A meta-raps for the early/tardy single machine scheduling problem

DOI10.1080/00207540701742427MaRDI QIDQ3055652zbMATH OpenOpenAlexFDO

Authors S. Hepdogan, R. Moraga, Gail W. DePuy, Gary E. Whitehouse

Publication date 8 November 2010

Published in International Journal of Production Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207540701742427

zbMATH Keywords

lean manufacturingmeta-heuristicschedulingsequence dependent setup times

Mathematics Subject Classification ID

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

Recommendations

• A composite heuristic for the single machine early/tardy job scheduling problem.
• Metaheuristics for the single machine weighted quadratic tardiness scheduling problem
• A heuristic for single machine scheduling with early and tardy costs
• Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
• A GRASP for a difficult single machine scheduling problem

Cites work

• A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time
• A GRASP for parallel machine scheduling with time windows
• A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties
• A simple and effective heuristic for the resource constrained project scheduling problem
• An effective and simple heuristic for the set covering problem
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Earliness-tardiness scheduling with setup considerations
• Greedy randomized adaptive search procedures
• Minimizing the average deviation of job completion times about a common due date
• Parallel machine scheduling with earliness and tardiness penalties
• Scheduling with batch setup times and earliness-tardiness penalties
• Sequencing with Earliness and Tardiness Penalties: A Review
• Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
• The effects of coefficient correlation structure in two-dimensional knapsack problems on solution procedure performance

Cited in

(4)

• Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem
• Memory and learning in metaheuristics
• The third comprehensive survey on scheduling problems with setup times/costs
• An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times

This page was built for publication: A meta-raps for the early/tardy single machine scheduling problem

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