Results 201 to 210 of about 2,256 (263)
Solving multi-scenario hybrid flow shop scheduling problem based on an improved probe machine model. [PDF]
PLoS OneTian X, Kong Y, Liu X.
europepmc +1 more source
A novel dynamic scheduling model for application in multimode approach. [PDF]
Sci RepElqabli Z, Kamach O, Khatab A, Chater Y.
europepmc +1 more source
Robust optimization for multi-project scheduling via the critical chain method. [PDF]
PLoS OneTian M, Li X.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
1997
The job shop scheduling problem (JSP) is a resource allocation problem where the resources are called machines. The problem involves finding an assignment (schedule) for a set of jobs to the machines so that the jobs can be completed “optimally.” Each job may consist of several tasks, and each task must be processed on a particular machine. Furthermore,
Nirwan Ansari, Edwin Hou
openaire +2 more sources
The job shop scheduling problem (JSP) is a resource allocation problem where the resources are called machines. The problem involves finding an assignment (schedule) for a set of jobs to the machines so that the jobs can be completed “optimally.” Each job may consist of several tasks, and each task must be processed on a particular machine. Furthermore,
Nirwan Ansari, Edwin Hou
openaire +2 more sources
Scheduling the General Job-Shop
Management Science, 1985A family of algorithms is described for finding optimum schedules for job-shops. The algorithms are of a branch and bound type but have a complete schedule associated with each node of the search tree. Branching from nodes is based on important conflicts in the schedule. Some results are provided.
Jeffrey R. Barker, Graham B. McMahon
openaire +1 more source
1996
Within the great variety of production scheduling problems the general job shop problem (JSP) is the probably most studied one by academic research during the last decade. It has earned a reputation for being notoriously difficult to solve. It illustrates at least some of the demands required by a wide array of real world problems.
SIMON Y. FOO, YOSHIYASU TAKEFUJI
openaire +2 more sources
Within the great variety of production scheduling problems the general job shop problem (JSP) is the probably most studied one by academic research during the last decade. It has earned a reputation for being notoriously difficult to solve. It illustrates at least some of the demands required by a wide array of real world problems.
SIMON Y. FOO, YOSHIYASU TAKEFUJI
openaire +2 more sources
Job Shop Scheduling With Deadlines
Journal of Combinatorial Optimization, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BALAS E. +3 more
openaire +3 more sources
Constraint-Based Job Shop Scheduling with IILOG SCHEDULER
Journal of Heuristics, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nuijten, W.P.M., Le Pape, C.
openaire +2 more sources