Hybrid algorithms for the earliness–tardiness single-machine multiple orders per job scheduling problem with a common due date

DOI10.1051/ro/2018029zbMath1411.90084OpenAlexW2799856715MaRDI QIDQ4634328

Lars Mönch, Jens Rocholl

Publication date: 7 May 2019

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2018029

zbMATH Keywords

schedulingcommon due datemultiple orders per jobsemiconductor manufacturing

Mathematics Subject Classification ID

General topics of discrete mathematics in relation to computer science (68R01) Deterministic scheduling theory in operations research (90B35) Traffic problems in operations research (90B20)

Related Items

Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window

Uses Software

• GALib
• Genocop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Grouping genetic algorithms for solving single machine multiple orders per job scheduling problems
• Integrated heuristics for scheduling multiple order jobs in a complex job shop
• Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint
• Minimizing makespan with multiple-orders-per-job in a two-machine flowshop
• Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date
• Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem
• Multiple orders per job batch scheduling with incompatible jobs
• Column generation heuristics for multiple machine, multiple orders per job scheduling problems
• Scheduling multiple orders per job in a single machine to minimize total completion time
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system
• A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines
• A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times
• Minimizing the average deviation of job completion times about a common due date
• Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Scheduling