Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm
From MaRDI portal
Publication:5687644
DOI<709::AID-NAV7>3.0.CO;2-9 10.1002/(SICI)1520-6750(199608)43:5<709::AID-NAV7>3.0.CO;2-9zbMath0868.90062OpenAlexW1997547289MaRDI QIDQ5687644
Reha Uzsoy, Rodney Traub, Suresh Chand
Publication date: 21 January 1997
Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199608)43:5<709::aid-nav7>3.0.co;2-9
Related Items
A mixed integer programming approach for the single machine problem with unequal release dates ⋮ An iterative heuristic for the single machine dynamic total completion time scheduling problem ⋮ A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families ⋮ Single-machine scheduling with no idle time and release dates to~minimize a regular criterion ⋮ Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. ⋮ A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals ⋮ Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates ⋮ Scheduling batch processing machines with incompatible job families ⋮ On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation ⋮ A decomposition scheme for single stage scheduling problems ⋮ Scheduling a single machine to minimize a regular objective function under setup constraints ⋮ Terminal penalty rolling scheduling based on an initial schedule for single-machine scheduling problem
