Local search heuristics for two-stage flow shop problems with secondary criterion

DOI10.1016/S0305-0548(00)00061-7zbMath1026.90103DBLPjournals/cor/GuptaHW02OpenAlexW2072187533WikidataQ57633942 ScholiaQ57633942MaRDI QIDQ5955475

Jatinder N. D. Gupta, Frank Werner, Karsten Hennig

Publication date: 13 February 2002

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

Full work available at URL: https://doi.org/10.1016/s0305-0548(00)00061-7

Mathematics Subject Classification ID

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

Related Items (14)

Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic ⋮ Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines ⋮ A local search using solution fragments for the 2-machine bicriteria scheduling problem ⋮ Dispatching problems for parallel machines in the TFT‐LCD assembly process ⋮ A bicriteria flowshop scheduling with a learning effect ⋮ Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints ⋮ Best compromise solution for a new multiobjective scheduling problem ⋮ A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness ⋮ Permutation flow shop scheduling with earliness and tardiness penalties ⋮ Counting and enumeration complexity with application to multicriteria scheduling ⋮ Genetic local search for multi-objective flowshop scheduling problems ⋮ RELIABILITY CENTERED MULTI OBJECTIVE HYBRID FLOW SHOP SCHEDULING ⋮ An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem ⋮ Two-machine flowshop scheduling with a secondary criterion

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• Multiple and bicriteria scheduling: A literature survey
• Large-step Markov chains for the TSP incorporating local search heuristics
• Genetic algorithms for the two-stage bicriteria flowshop problem
• Job-shop scheduling: Computational study of local search and large-step optimization methods
• A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
• Heuristics for permutation flow shop scheduling with batch setup times
• A comparison of local search methods for flow shop scheduling
• Optimal two- and three-stage production schedules with setup times included
• Convergence of an annealing algorithm
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Tabu Search—Part I
• Two-Stage Flowshop Scheduling Problem with Bicriteria
• The Complexity of Flowshop and Jobshop Scheduling
• Equation of State Calculations by Fast Computing Machines
• Improving local search heuristics for some scheduling problems. II

This page was built for publication: Local search heuristics for two-stage flow shop problems with secondary criterion