Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates
From MaRDI portal
Publication:6554640
DOI10.1016/J.EJOR.2023.11.024MaRDI QIDQ6554640FDOQ6554640
Authors: Rafael Morais, Teobaldo L. Bulhões Júnior, A. Subramanian
Publication date: 13 June 2024
Published in: European Journal of Operational Research (Search for Journal in Brave)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Integrated production and outbound distribution scheduling problems with job release dates and deadlines
- Scheduling. Theory, algorithms, and systems.
- Variable neighborhood search
- A survey of scheduling problems with setup times or costs
- Title not available (Why is that?)
- Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
- Greedy randomized adaptive search procedures
- New route relaxation and pricing strategies for the vehicle routing problem
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- The third comprehensive survey on scheduling problems with setup times/costs
- Title not available (Why is that?)
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
- Scheduling unrelated parallel machines with sequence-dependent setups
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- A simple and effective metaheuristic for the minimum latency problem
- Title not available (Why is that?)
- Scheduling tasks with sequence-dependent processing times
- A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan
- 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
- On the exact solution of a large class of parallel machine scheduling problems
- A branch-and-price algorithm for the minimum latency problem
- 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
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)