Results 61 to 70 of about 115,975 (208)
Complex & Intelligent SystemsThe flexible job-shop scheduling problem (FJSP) with parallel batch processing machine (PBM) is one of those long-standing issues that needs cutting-edge approaches. It is a recent extension of standard flexible job shop scheduling problems.
Lirui Xue +3 more
doaj +1 more source
Job Shop Scheduling Using Artificial Immune System [PDF]
, 2012 Efficiency in job shop scheduling plays an important role when a large number of jobs and machines are considered. The job shop scheduling problems are one of the NP hard problems. Many heuristic methods give solutions with near optimal results.
Mahapatra, Deepak Kumar
core
REAL-TIME SCHEDULING IN A SENSORISED FACTORY USING CLOUD-BASED SIMULATION WITH MOBILE DEVICE ACCESS
South African Journal of Industrial Engineering, 2017 Scheduling is a challenge that persists in the operational phase of the manufacturing life-cycle. The challenge can be attributed to the complex, dynamic, and stochastic nature of a manufacturing system.
Stephan Snyman, James Bekker
doaj +1 more source
Evaluate Flexible Job Scheduling Problem Using Elitist Ant [PDF]
BIO Web of ConferencesOne significant approach that is frequently utilized in many applications, particularly in industry, is scheduling .An extension of job scheduling, the Flexible Job Shop Scheduling Problem (FJSP), has a number of real-world uses .This subject has ...
Ali Zainab, Hassan Luma S.
doaj +1 more source
Journal of Applied Mathematics, 2012 Scheduled production system leads to avoiding stock accumulations, losses reduction, decreasing or even eliminating idol machines, and effort to better benefitting from machines for on time responding customer orders and supplying requested materials in ...
Behnam Barzegar +2 more
doaj +1 more source
IEEE Access, 2020 Open shop scheduling problems have many practical applications, in which the jobs can be in any order with the only restriction that their durations do not overlap with each other. In some cases, the order of a subset of jobs dictates the flow shop model
Guanqun Ni, Lei Chen
doaj +1 more source
An approximation algorithm for the three-machine scheduling problem with the routes given by the same partial order [PDF]
, 2014 The paper considers a three-machine shop scheduling problem to minimize the makespan, in which the route of a job should be feasible with respect to a machine precedence digraph with three nodes and one arc.
Quibell, Richard, Strusevich, Vitaly A.
core +1 more source
PENYELESAIAN MASALAH JOB SHOP MENGGUNAKAN ALGORITMA GENETIKA
Jurnal Masyarakat Informatika, 2010 Job Shop Scheduling Problem (JSP) is a problem of work scheduling that can be describe by one or several job that have to be done by one or several source, each job contain of several operation that has to be done without interuption in several time and ...
Satriyo Adhy, Kushartantya Kushartantya
doaj +1 more source
job shop scheduling problem:literature review
Tikrit Journal of Pure Science, 2020 As an extension of the Job Shop Scheduling (JSP), Flexible job-shop Scheduling Problem (FJSP), can be defined as one of the most significant problems in up-to-date manufacturing systems, recently a lot of studies have been conducted to address FJSP ...
Marrwa Abd-AlKareem Alabajee +2 more
doaj +1 more source
Genetic Programming for Job Shop Scheduling [PDF]
, 2018 © 2019, Springer International Publishing AG, part of Springer Nature. Designing effective scheduling rules or heuristics for a manufacturing system such as job shops is not a trivial task. In the early stage, scheduling experts rely on their experiences to develop dispatching rules and further improve them through trials-and-errors, sometimes with the
KC Tan +3 more
openaire +2 more sources