Minimizing earliness and tardiness penalties in a single-machine problem with a common due date

DOI10.1016/J.EJOR.2004.03.006MaRDI QIDQ1887879zbMATH OpenOpenAlexFDO

Authors Celso M. Hino, André B. Mendes, Débora P. Ronconi

Publication date 22 November 2004

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

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

zbMATH Keywords

SchedulingSingle machineMetaheuristicEarliness/tardiness

Mathematics Subject Classification ID

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

Recommendations

• A single machine scheduling problem with earliness/tardiness and starting time penalties under a common due date
• Single machine weighted earliness-tardiness penalty problem with a common due date
• Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty
• OPTIMAL SINGLE-MACHINE SCHEDULING FOR MINIMIZING THE SUM OF EARLINESS AND TARDINESS PENALTIES
• scientific article; zbMATH DE number 7448659
• Optimal single-machine scheduling about a common due window with earliness/tardiness and additional penalties
• scientific article; zbMATH DE number 1563208
• Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates

Cites work

• scientific article; zbMATH DE number 31717 (Why is no real title available?)
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 1016767 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• A hybrid genetic algorithm for the job shop scheduling problem
• A survey of the state-of-the-art of common due date assignment and scheduling research
• An SA/TS mixture algorithm for the scheduling tardiness problem
• Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• Genetic Algorithms-a Tool for OR?
• Genetic algorithms and tabu search: Hybrids for optimization
• Heuristics from Nature for Hard Combinatorial Optimization Problems
• Minimizing the average deviation of job completion times about a common due date
• Sequencing with Earliness and Tardiness Penalties: A Review
• Survey of scheduling research involving due date determination decisions
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• Using tabu search to solve the common due date early/tardy machine scheduling problem

Cited in

(27)

• Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
• New approaches to due date assignment in job shops
• scientific article; zbMATH DE number 7448659 (Why is no real title available?)
• Machine scheduling with earliness, tardiness and non-execution penalties
• Minimizing the earliness-tardiness for the customer order scheduling problem in a dedicated machine environment
• Minimization of total absolute deviation for a common due date
• Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey
• The single machine weighted mean squared deviation problem
• Order acceptance using genetic algorithms
• Solving scheduling problems with earliness and tardiness penalties using priority rules and linear programming
• On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date
• Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration
• scientific article; zbMATH DE number 3904315 (Why is no real title available?)
• Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models
• Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method
• Single machine scheduling with flow time and earliness penalties
• Self-adaptive biased differential evolution for scheduling against common due dates
• A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date
• Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
• Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
• Minimizing the number of tardy jobs in two-machine settings with common due date
• Variable parameters lengths genetic algorithm for minimizing earliness-tardiness penalties of single machine scheduling with a common due date
• A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs
• Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
• HEURISTIC ALGORITHMS FOR A SINGLE-MACHINE COMMON DUE DATE ASSIGNMENT UNDER EARLINESS/TARDINESS MEASURE
• Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine
• Exponential neighborhood search for a parallel machine scheduling problem

Describes a project that uses

Uses Software

• Tabu search

This page was built for publication: Minimizing earliness and tardiness penalties in a single-machine problem with a common due date

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