Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines

DOI10.1016/J.COR.2004.01.003MaRDI QIDQ2387249zbMATH OpenOpenAlexFDO

Authors Chinyao Low

Publication date 2 September 2005

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2004.01.003

zbMATH Keywords

Simulated annealingTotal flow timeFlow shopUnrelated parallel machines

Mathematics Subject Classification ID

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

Recommendations

• A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
• scientific article; zbMATH DE number 2086794
• An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal
• New heuristics for no-wait flowshops to minimize makespan.
• Scheduling in flowshops to minimize total tardiness of jobs

Cites work

• scientific article; zbMATH DE number 1647923 (Why is no real title available?)
• A fast tabu search algorithm for the permutation flow-shop problem
• A tabu search approach for the flow shop scheduling problem
• An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal
• Early/tardy scheduling with sequence dependent setups on uniform parallel machines
• Flowshop scheduling with identical jobs and uniform parallel machines
• Global lower bounds for flow shops with multiple processors
• Heuristic approaches for n/m/F/ C_i scheduling problems
• Heuristics for scheduling in a flow shop with multiple processors
• Local search algorithms for the multiprocessor flow shop scheduling problem
• Local search heuristics for two-stage flow shop problems with secondary criterion
• Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
• Scheduling on uniform parallel machines to minimize maximum lateness
• Scheduling parallel machines to minimize total weighted and unweighted tardiness
• Scheduling under a common due-date on parallel unrelated machines
• Sequencing n jobs on two machines with setup, processing and removal times separated
• Sequency on two and three machines with setup, processing and removal times separated
• The flow shop with parallel machines: A tabu search approach
• The permutation flow shop with buffers: A tabu search approach
• Two branch and bound algorithms for the permutation flow shop problem

Cited in

(27)

• Metaheuristic algorithms for the hybrid flowshop scheduling problem
• Using simulated annealing to schedule a flowshop manufacturing cell with sequence-dependent family setup times
• Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines
• Design of supply chain networks with multi-phased discount price and service level: formulation, complexity, and algorithm
• A simulated annealing approach for reliability-based chance-constrained programming
• A simulated annealing approach to minimize the maximum lateness on uniform parallel machines
• Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry
• Scheduling algorithms for real-time computing systems admitting simulation models
• A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal
• Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility
• Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
• Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• The hybrid flow shop scheduling problem
• A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints
• A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
• Auxiliary resource planning in a flexible flow shop scheduling problem considering stage skipping
• A survey of scheduling problems with setup times or costs
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
• An integrated approach for modeling and solving the scheduling problem of container handling systems
• A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines
• Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in small and medium enterprises
• A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem
• Optimizing the production schedule of an agricultural cooperative: a case study
• An effective scheduling method to single-arm cluster tools for processing multiple wafer types
• Minimizing the number of late jobs for the permutation flowshop problem with secondary resources
• Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints

This page was built for publication: Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines

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