Two-machine open shop scheduling with secondary criteria

DOI10.1111/1475-3995.00407zbMath1087.90030OpenAlexW2112204631WikidataQ57633937 ScholiaQ57633937MaRDI QIDQ3044040

Jatinder N. D. Gupta, Gunnar Wulkenhaar, Frank Werner

Publication date: 10 August 2004

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/1475-3995.00407

zbMATH Keywords

simulated annealingthreshold acceptingempirical evaluationopen shop schedulingconstructive and iterative heuristicssecondary criteria

Mathematics Subject Classification ID

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

Related Items (2)

Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop ⋮ A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times

Cites Work

• Unnamed Item
• Scheduling ordered open shops
• Multiple and bicriteria scheduling: A literature survey
• Two machine open shop scheduling problems with bi-criteria
• A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
• Open shop scheduling with makespan and total completion time criteria
• Open Shop Scheduling to Minimize Finish Time

This page was built for publication: Two-machine open shop scheduling with secondary criteria