Generalized pairwise interchanges and machine scheduling
From MaRDI portal
Publication:1388824
DOI10.1016/0377-2217(95)00009-FzbMath0904.90085OpenAlexW2048562612MaRDI QIDQ1388824
Publication date: 11 June 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(95)00009-f
Related Items
Scheduling with compressible and stochastic release dates ⋮ An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification ⋮ An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem ⋮ A heuristic algorithm to minimize total weighted tardiness on a single machine with release times ⋮ Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems ⋮ An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups ⋮ Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling ⋮ An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parametric precedence relations in single machine scheduling
- A new lower bound approach for single-machine multicriteria scheduling
- The two-machine total completion time flow shop problem
- Minimising makespan in the two-machine flow-shop with release times
- Job Shop Scheduling by Simulated Annealing
- The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness