The complexity of scheduling jobs in repetitive manufacturing systems

DOI10.1016/0377-2217(93)90247-KzbMath0782.90053MaRDI QIDQ1310021

Hichem Kamoun, Chelliah Skriskandarajah

Publication date: 28 February 1994

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

flowshopcomplexity resultsjobshopcyclic schedules\(NP\)-hardaverage work-in-process inventoryopenshoprepetitive manufacturing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (19)

Modified characteristics projection finite element method for time-dependent conduction-convection problems ⋮ Declarative Modeling for Multimodal Processes Driven Distribution Networks ⋮ Sequencing and scheduling in robotic cells: recent developments ⋮ 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 ⋮ Medium term production management for cyclic deliveries ⋮ Two machine flow shop scheduling problem with weighted WIP costs ⋮ An algorithm for the maximum revenue jobshop problem ⋮ Flow shops with WIP and value added costs ⋮ Timed event graph-based cyclic reconfigurable flow shop modelling and optimization ⋮ The complexity of a cyclic scheduling problem with identical machines and precedence constraints ⋮ Sequencing jobs for an automated manufacturing module with buffer ⋮ An improved algorithm for cyclic flowshop scheduling in a robotic cell ⋮ Scheduling in network flow shops ⋮ Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing ⋮ A review of TSP based approaches for flowshop scheduling ⋮ The complexity of scheduling jobs in repetitive manufacturing systems ⋮ The complexity of cyclic shop scheduling problems

Uses Software

• PESPLib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New directions in scheduling theory
• Some no-wait shops scheduling problems: Complexity aspect
• The complexity of scheduling jobs in repetitive manufacturing systems
• Optimal planning of part's machining on a number of machines
• Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
• Some new results in flow shop scheduling
• The Three-Machine No-Wait Flow Shop is NP-Complete
• A Mathematical Model for Periodic Scheduling Problems
• Complexity of Scheduling Shops with No Wait in Process
• Technical Note—A Solvable Cyclic Scheduling Problem with Serial Precedence Structure
• Flowshop scheduling with limited temporary storage
• Cyclic Schedules for Job Shops with Identical Jobs
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem

This page was built for publication: The complexity of scheduling jobs in repetitive manufacturing systems