Scheduling the production of two-component jobs on a single machine

DOI10.1016/S0377-2217(99)00154-XzbMath0953.90027OpenAlexW2052267630MaRDI QIDQ1969827

Chris N. Potts, A. E. Gerodimos, Celia A. Dr. Glass

Publication date: 19 March 2000

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00154-x

zbMATH Keywords

dynamic programmingsingle machineNP-hardcomponent scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective, Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures, Optimal single machine scheduling of products with components and changeover cost, Scheduling parallel machines for the customer order problem, Scheduling with batching: A review, Scheduling the production of two-component jobs on a single machine, Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence, A survey of scheduling problems with setup times or costs, Optimal scheduling of two-component products on a single facility, Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic, The complexity of customer order scheduling problems on parallel machines, Fabrication scheduling on a single machine with due date constraints, Improved dynamic programs for some batching problems involving the maximum lateness criterion, A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Batch sizing and job sequencing on a single machine
• Batching in single operation manufacturing systems
• The complexity of one-machine batching problems
• Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions
• Batch scheduling to minimize maximum lateness
• Single machine hierarchical scheduling with customer orders and multiple job classes
• Batch scheduling to minimize total completion time
• Scheduling multi-operation jobs on a single machine
• Scheduling the production of two-component jobs on a single machine
• Optimal Scheduling of Products with Two Subassemblies on a Single Machine
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• The customer order lead-time problem on parallel machines