Genetic algorithms to minimize the weighted number of late jobs on a single machine.
From MaRDI portal
Publication:1410613
DOI10.1016/S0377-2217(02)00827-5zbMath1053.90046OpenAlexW2052828506MaRDI QIDQ1410613
Stéphane Dauzère-Pérès, Marc Sevaux
Publication date: 14 October 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00827-5
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Maximizing the weighted number of just-in-time jobs in flow shop scheduling ⋮ Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times ⋮ Minimising makespan for two batch-processing machines with non-identical job sizes in job shop ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem ⋮ Genetic local search with distance preserving recombination operator for a vehicle routing problem. ⋮ Impact of deadline intervals on behavior of solutions to the random sequencing jobs with deadlines problem ⋮ Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes ⋮ A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates ⋮ Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes ⋮ Server cloud scheduling ⋮ On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation ⋮ Order acceptance using genetic algorithms ⋮ Using short-term memory to minimize the weighted number of late jobs on a single machine.
Cites Work
- Unnamed Item
- Unnamed Item
- Minimizing late jobs in the general one machine scheduling problem
- Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
- A genetic algorithm for flowshop sequencing
- Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
- A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Feature Article—Genetic Algorithms for the Operations Researcher
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
