Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates

Cites work

scientific article; zbMATH DE number 23663 (Why is no real title available?)
scientific article; zbMATH DE number 1082108 (Why is no real title available?)
scientific article; zbMATH DE number 7124428 (Why is no real title available?)
A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan
A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
A branch-and-price algorithm for the minimum latency problem
A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
A simple and effective metaheuristic for the minimum latency problem
A survey of scheduling problems with setup times or costs
A variable neighborhood descent as ILS local search to the minimization of the total weighted tardiness on unrelated parallel machines and sequence dependent setup times
An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics
Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
Greedy randomized adaptive search procedures
Integrated production and outbound distribution scheduling problems with job release dates and deadlines
New route relaxation and pricing strategies for the vehicle routing problem
On the exact solution of a large class of parallel machine scheduling problems
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
Scheduling tasks with sequence-dependent processing times
Scheduling unrelated parallel machines with sequence-dependent setups
Scheduling. Theory, algorithms, and systems.
The third comprehensive survey on scheduling problems with setup times/costs
Variable neighborhood search

This page was built for publication: Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates

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