Parallel flowshop scheduling using Tabu search

DOI10.1080/0020754031000106443MaRDI QIDQ4474674zbMATH OpenOpenAlexFDO

Authors Dong Cao, Mingyuan Chen

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• The flow shop with parallel machines: A tabu search approach
• Scheduling flexible manufacturing cells using tabu search
• scientific article; zbMATH DE number 1488079
• Parallel machine scheduling with tool loading
• A tabu search approach for the flow shop scheduling problem

Cites work

• `` Strong NP-Completeness Results
• An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime
• Defining tabu list size and aspiration criterion within tabu search methods
• General local search methods
• Optimal two- and three-stage production schedules with set-up time included
• Parallel machine scheduling with earliness and tardiness penalties
• Parallel machine scheduling, linear programming, and parameter list scheduling heuristics
• Scheduling Groups of Jobs on a Single Machine
• Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
• Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
• Two-machine flowshop scheduling with a secondary criterion

Cited in

(19)

• A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
• Performance evaluation of a parallel tabu search task scheduling algorithm
• Parallel machine scheduling with tool loading
• Parallel machine selection and job scheduling to minimize machine cost and job tardiness
• A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops
• An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem
• Solving a job-shop scheduling problem based on a tabu search algorithm
• Scheduling flexible manufacturing cells using tabu search
• A parallel tabu search for solving the primal buffer allocation problem in serial production systems
• Approximation algorithms for the parallel flow shop problem
• scientific article; zbMATH DE number 2159396 (Why is no real title available?)
• An extensive tabu search algorithm for solving the lot streaming problem in a job shop environment
• A review and classification on distributed permutation flowshop scheduling problems
• The distributed no-idle permutation flowshop scheduling problem with due windows
• Fifty years of research in scheduling -- theory and applications
• Advanced metaheuristics for bi-criteria optimization in a distributed blocking flow shop problem with setup times
• An efficient polynomial-time approximation scheme for parallel multi-stage open shops
• Logic-based benders decomposition methods for the distributed permutation flow shop scheduling problem with production and transportation cost
• Efficient heuristics for the weighted tardiness distributed permutation flowshop scheduling problem

This page was built for publication: Parallel flowshop scheduling using Tabu search

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