A meta-raps for the early/tardy single machine scheduling problem
From MaRDI portal
Publication:3055652
DOI10.1080/00207540701742427zbMATH Open1198.90185OpenAlexW2011041206MaRDI QIDQ3055652FDOQ3055652
Gary E. Whitehouse, Gail W. DePuy, R. Moraga, S. Hepdogan
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
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
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- A simple and effective heuristic for the resource constrained project scheduling problem
- An effective and simple heuristic for the set covering problem
- Greedy randomized adaptive search procedures
- Parallel machine scheduling with earliness and tardiness penalties
- A GRASP for parallel machine scheduling with time windows
- Sequencing with Earliness and Tardiness Penalties: A Review
- Earliness-tardiness scheduling with setup considerations
- A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time
- The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance
- A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties
- Minimizing the average deviation of job completion times about a common due date
- Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
- Scheduling with batch setup times and earliness-tardiness penalties
Cited In (4)
- Memory and Learning in Metaheuristics
- An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
- The third comprehensive survey on scheduling problems with setup times/costs
- Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem
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)