Two-machine flowshop scheduling with a secondary criterion

DOI10.1016/S0305-0548(02)00021-7zbMATH Open1026.90044OpenAlexW2073196058MaRDI QIDQ1870802FDOQ1870802

Authors: Vincent T'kindt, Jatinder N. D. Gupta, J.-C. Billaut 

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

Recommendations

• The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm
• The two-machine total completion time flow shop problem
• Two-Stage Flowshop Scheduling Problem with Bicriteria
• A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem
• The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation

zbMATH Keywords

heuristicsdynamic programminginteger programmingbranch-and-boundbicriteria schedulingflowshop

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (33)

• Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time
• Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
• Two-machine flowshop scheduling to minimize mean flow time
• Scheduling alternative operations in two-machine flow-shops
• Minimising makespan in the two-machine flow-shop with release times
• A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints
• Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
• Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times.
• Best compromise solution for a new multiobjective scheduling problem
• Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
• Two-Stage Flowshop Scheduling Problem with Bicriteria
• Flowshop-scheduling problems with makespan criterion: a review
• An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
• Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
• Practical solutions for a dock assignment problem with trailer transportation
• Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs
• A matheuristic approach for the two-machine total completion time flow shop problem
• Parallel flowshop scheduling using Tabu search
• Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
• Flow-shop scheduling for three serial stations with the last two duplicate
• A two-machine flowshop problem with two agents
• Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date
• A cyclical search for the two machine flow shop and open shop to minimise finishing time
• A bicriteria flowshop scheduling with a learning effect
• The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm
• Multicriteria scheduling
• Two-machine flow shop scheduling with two criteria: maximum earliness and makespan
• Local search heuristics for two-stage flow shop problems with secondary criterion
• Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits
• Bicriteria train scheduling for high-speed passenger railroad planning applications
• Two-machine open shop scheduling with secondary criteria
• Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case
• Counting and enumeration complexity with application to multicriteria scheduling

This page was built for publication: Two-machine flowshop scheduling with a secondary criterion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1870802)