A bicriteria two-machine permutation flowshop problem
From MaRDI portal
Publication:1296104
DOI10.1016/S0377-2217(97)00338-XzbMath0943.90041OpenAlexW2081267914MaRDI QIDQ1296104
Gündüz Ulusoy, Funda Sivrikaya-Serifoglu
Publication date: 11 July 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00338-x
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items
Two-machine flow shop scheduling with two criteria: maximum earliness and makespan ⋮ A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime ⋮ A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation ⋮ An exact parallel method for a bi-objective permutation flowshop problem ⋮ No-wait flowshops with bicriteria of makespan and maximum lateness. ⋮ Generating outpatient chemotherapy appointment templates with balanced flowtime and makespan ⋮ A bicriteria flowshop scheduling with a learning effect ⋮ A bicriteria \(m\)-machine flowshop scheduling with sequence-dependent setup times ⋮ Multicriteria scheduling problems: a survey ⋮ Counting and enumeration complexity with application to multicriteria scheduling ⋮ Multicriteria scheduling ⋮ Genetic local search for multi-objective flowshop scheduling problems ⋮ Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation ⋮ 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
Cites Work
- Multiple and bicriteria scheduling: A literature survey
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- The two-machine total completion time flow shop problem
- Two branch and bound algorithms for the permutation flow shop problem
- Complexity of single machine, multi-criteria scheduling problems
- Heuristics for scheduling in flowshop with multiple objectives
- Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases
- Optimal two- and three-stage production schedules with setup times included
- Two-Stage Flowshop Scheduling Problem with Bicriteria
- A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem
- Computer Solutions of the Traveling Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
