Two-machine flowshop scheduling with a secondary criterion

DOI10.1016/S0305-0548(02)00021-7zbMath1026.90044OpenAlexW2073196058MaRDI QIDQ1870802

Jean-Charles Billaut, Jatinder N. D. Gupta, Vincent T'kindt

Publication date: 14 May 2003

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

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

zbMATH Keywords

heuristicsinteger programmingbicriteria schedulingdynamic programmingbranch-and-boundflowshop

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)

Related Items

Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic ⋮ Practical solutions for a dock assignment problem with trailer transportation ⋮ A bicriteria flowshop scheduling with a learning effect ⋮ Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints ⋮ Mixed integer formulation to minimize makespan in a flow shop with batch processing machines ⋮ Best compromise solution for a new multiobjective scheduling problem ⋮ Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ Counting and enumeration complexity with application to multicriteria scheduling ⋮ Parallel flowshop scheduling using Tabu search ⋮ Multicriteria scheduling ⋮ Bicriteria train scheduling for high-speed passenger railroad planning applications ⋮ Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case ⋮ Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time

Cites Work

• Unnamed Item
• Unnamed Item
• Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
• The two-machine total completion time flow shop problem
• Genetic algorithms for the two-stage bicriteria flowshop problem
• An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
• Two-machine flowshop scheduling to minimize mean flow time
• Multicriteria scheduling problems: a survey
• Optimal two- and three-stage production schedules with setup times included
• Two-Stage Flowshop Scheduling Problem with Bicriteria
• The Complexity of Flowshop and Jobshop Scheduling
• A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem
• Local search heuristics for two-stage flow shop problems with secondary criterion