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

DOI10.1016/J.EJOR.2010.03.034MaRDI QIDQ992578zbMATH OpenOpenAlexFDO

Authors 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 programmingmultiple orders per jobschedulingsemiconductor manufacturing

Mathematics Subject Classification ID

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

Recommendations

• Minimizing makespan with multiple-orders-per-job in a two-machine flowshop
• Minimizing the range of order completion times with multiple job classes
• scientific article; zbMATH DE number 6874349
• scientific article; zbMATH DE number 6611746
• Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines

Cites work

• Column generation heuristics for multiple machine, multiple orders per job scheduling problems
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Minimizing makespan with multiple-orders-per-job in a two-machine flowshop
• Multiple orders per job batch scheduling with incompatible jobs
• On general routing problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines
• Worst-case analyses, linear programming and the bin-packing problem

Cited in

(14)

• 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
• A note on a single-machine lot scheduling problem with indivisible orders
• A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times
• Multistage stochastic programming approach for joint optimization of job scheduling and material ordering under endogenous uncertainties
• Customer order scheduling to minimize the number of late jobs
• Grouping genetic algorithms for solving single machine multiple orders per job scheduling problems
• scientific article; zbMATH DE number 6611746 (Why is no real title available?)
• Minimizing the Range of Order Completion Times with Multiple Job Classes
• Hybrid algorithms for the earliness-tardiness single-machine multiple orders per job scheduling problem with a common due date
• scientific article; zbMATH DE number 6874349 (Why is no real title available?)
• Minimizing the range of order completion times with multiple job classes
• An order scheduling heuristic to minimize the total collation delays and the makespan in high-throughput make-to-order manufacturing systems
• Sequence-dependent scheduling with order deliveries

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q992578)