A differential evolution approach for the common due date early/tardy job scheduling problem

DOI10.1016/j.cor.2006.08.013zbMath1179.90147OpenAlexW2016245653MaRDI QIDQ941556

Andreas C. Nearchou

Publication date: 1 September 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2006.08.013

zbMATH Keywords

common due datejob schedulingdifferential evolutionjust-in-time productionearly/tardy

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Dynamic routing strategies for JIT production in hybrid flow shops, Flexible open shop scheduling problem to minimize makespan, Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models, Due-window assignment problems with unit-time jobs, Estimating the parameters of 3-p Weibull distribution through differential evolution, The single machine weighted mean squared deviation problem, An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers, Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Survey of scheduling research involving due date determination decisions
• Using tabu search to solve the common due date early/tardy machine scheduling problem
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• A composite heuristic for the single machine early/tardy job scheduling problem.
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Population set-based global optimization algorithms: some modifications and numerical studies
• A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time
• Common due-date determination and sequencing using tabu search
• A numerical study of some modified differential evolution algorithms
• Minimizing the average deviation of job completion times about a common due date
• Sequencing with Earliness and Tardiness Penalties: A Review
• Minimizing mean absolute deviation of completion times about a common due date
• 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
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates