Cyclic Schedules for Job Shops with Identical Jobs
From MaRDI portal
Publication:4027791
DOI10.1287/moor.17.4.842zbMath0770.90036OpenAlexW2060975749MaRDI QIDQ4027791
Publication date: 1 March 1993
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.17.4.842
Related Items (24)
A job-splitting heuristic for lot-size scheduling in multi-stage, multi- product production processes ⋮ Cyclic scheduling to minimize inventory in a batch flow line ⋮ Some complexity results in cyclic scheduling ⋮ A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints ⋮ A study of the cyclic scheduling problem on parallel processors ⋮ Cyclic multiple-robot scheduling with time-window constraints using a critical path approach ⋮ A fluid approach to large volume job shop scheduling ⋮ Complexity of cyclic job shop scheduling problems for identical jobs with no-wait constraints ⋮ Tabu search algorithms for cyclic machine scheduling problems ⋮ The robust cyclic job shop problem ⋮ Minimizing flow time in cyclic schedules for identical jobs with acyclic precedence: The bottleneck lower bound. ⋮ A mixed integer programming model for the cyclic job-shop problem with transportation ⋮ Construction of cyclic schedules in presence of parallel machines ⋮ Mathematical model for cyclic scheduling with work-in-process minimization ⋮ High-multiplicity cyclic job shop scheduling ⋮ An approach to production planning and scheduling in cyclically scheduled manufacturing systems ⋮ Scheduling jobshops with some identical or similar jobs ⋮ Throughput-optimal sequences for cyclically operated plants ⋮ The complexity of a cyclic scheduling problem with identical machines and precedence constraints ⋮ Scheduling in network flow shops ⋮ The complexity of scheduling jobs in repetitive manufacturing systems ⋮ On scheduling cycle shops: Classification, complexity and approximation ⋮ Study of a NP-hard cyclic scheduling problem: The recurrent job-shop ⋮ The complexity of cyclic shop scheduling problems
This page was built for publication: Cyclic Schedules for Job Shops with Identical Jobs
