Parallel flowshop scheduling using Tabu search
From MaRDI portal
Publication:4474674
DOI10.1080/0020754031000106443zbMath1052.90551OpenAlexW2025939476MaRDI QIDQ4474674
Publication date: 12 July 2004
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0020754031000106443
Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Parallel machine selection and job scheduling to minimize machine cost and job tardiness ⋮ An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem ⋮ A review and classification on distributed permutation flowshop scheduling problems ⋮ A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops ⋮ Approximation algorithms for the parallel flow shop problem
Cites Work
- General local search methods
- Parallel machine scheduling with earliness and tardiness penalties
- Two-machine flowshop scheduling with a secondary criterion
- Parallel Machine Scheduling, Linear Programming, and Parameter List Scheduling Heuristics
- Optimal two- and three-stage production schedules with setup times included
- An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime
- `` Strong NP-Completeness Results
- Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
- Scheduling Groups of Jobs on a Single Machine
- Defining tabu list size and aspiration criterion within tabu search methods
- Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
