A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem
From MaRDI portal
Publication:4849290
DOI10.1057/jors.1995.102zbMath0832.90058OpenAlexW2011813554MaRDI QIDQ4849290
Jorge Haddock, Amit Nagar, Sunderesh S. Heragu
Publication date: 25 September 1995
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1995.102
simulated annealingtabu searchbranch-and-boundgenetic algorithmscomputational analysistwo-machine flow shop scheduling
Related Items
Two-machine flow shop scheduling with two criteria: maximum earliness and makespan ⋮ Outsourcing and scheduling for a two-machine flow shop with release times ⋮ A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem ⋮ A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints ⋮ No-wait flowshops with bicriteria of makespan and maximum lateness. ⋮ A bicriteria flowshop scheduling with a learning effect ⋮ A bicriteria \(m\)-machine flowshop scheduling with sequence-dependent setup times ⋮ Multicriteria scheduling problems: a survey ⋮ A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria ⋮ A bicriteria approach to the two-machine flow shop scheduling problem ⋮ Counting and enumeration complexity with application to multicriteria scheduling ⋮ Multicriteria scheduling ⋮ Genetic local search for multi-objective flowshop scheduling problems ⋮ A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs ⋮ A bicriteria two-machine permutation flowshop problem ⋮ Unnamed Item ⋮ An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem ⋮ The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime ⋮ Two-machine flowshop scheduling with a secondary criterion
