Scheduling multiple orders per job in a single machine to minimize total completion time

DOI10.1016/j.ejor.2010.03.034zbMath1205.90131OpenAlexW1994846011MaRDI QIDQ992578

Scott J. Mason, Jen-Shiang Chen

Publication date: 9 September 2010

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.03.034

zbMATH Keywords

heuristicsinteger programmingschedulingmultiple orders per jobsemiconductor manufacturing

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (5)

Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ Order acceptance and due-date quotation in low machine rates ⋮ Hybrid algorithms for the earliness–tardiness single-machine multiple orders per job scheduling problem with a common due date ⋮ A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times ⋮ Grouping genetic algorithms for solving single machine multiple orders per job scheduling problems

Cites Work

• Unnamed Item
• Minimizing makespan with multiple-orders-per-job in a two-machine flowshop
• Multiple orders per job batch scheduling with incompatible jobs
• Column generation heuristics for multiple machine, multiple orders per job scheduling problems
• Worst-case analyses, linear programming and the bin-packing problem
• Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines
• On general routing problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: Scheduling multiple orders per job in a single machine to minimize total completion time