Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey

DOI10.1016/j.mcm.2003.05.019zbMath1098.90031OpenAlexW1980904333WikidataQ57633933 ScholiaQ57633933MaRDI QIDQ1765094

Frank Werner, Volker Lauff

Publication date: 22 February 2005

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2003.05.019

zbMATH Keywords

Common due dateEarliness-tardiness penaltiesMultimachine schedulingNonregular criteria

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (26)

Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times ⋮ A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem ⋮ A survey on scheduling problems with due windows ⋮ Optimal restricted due date assignment in scheduling ⋮ Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics ⋮ Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness ⋮ Equitable scheduling on a single machine ⋮ Range of lower bounds ⋮ Exponential neighborhood search for a parallel machine scheduling problem ⋮ Complexities and algorithms for synchronized scheduling of parallel machine assembly and air transportation in consumer electronics supply chain ⋮ Four single-machine scheduling problems involving due date determination decisions ⋮ Two-agent single-machine scheduling with assignable due dates ⋮ Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs ⋮ Scheduling job classes on uniform machines ⋮ A multi-agent system for the weighted earliness tardiness parallel machine problem ⋮ Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling ⋮ Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity ⋮ Hierarchical production planning and scheduling in a multi-product, batch process environment ⋮ Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval ⋮ Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem ⋮ Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems ⋮ A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs ⋮ Unrelated parallel machine scheduling with multiple time windows: an application to Earth observation satellite scheduling ⋮ Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains ⋮ Scheduling problems with a common due window assignment: A survey

Cites Work

• Unnamed Item
• Unnamed Item
• Equivalence of mean flow time problems and mean absolute deviation problems
• The complexity of scheduling job families about a common due date
• On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties
• Parallel machine earliness and tardiness scheduling with proportional weights
• Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem
• An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date
• Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
• Minimizing the average deviation of job completion times about a common due date
• Sequencing with Earliness and Tardiness Penalties: A Review
• Single- and multiple-processor models for minimizing completion time variance
• Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
• The Complexity of Flowshop and Jobshop Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
• Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs
• Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties
• Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date
• Minmax earliness-tardiness costs with unit processing time jobs
• Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date

This page was built for publication: Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey