The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies

DOI10.1016/J.EJOR.2013.05.031MaRDI QIDQ2356207zbMATH OpenOpenAlexFDO

Authors Anis Gharbi, Talel Ladhari, Mohamed Kais Msakni, Mehdi Serairi

Publication date 29 July 2015

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2013.05.031

zbMATH Keywords

Lagrangian relaxationlower boundsschedulingsequence-independent setup timestotal completion timetwo-machine flowshop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• Polynomial lower bounds for the two-machine flowshop problem with sequence-independent setup times
• A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP
• The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm
• Lower bounds for the two-machine flow shop problem with time delays
• Lower bounds for minimizing total completion time in a two-machine flow shop

Cites work

• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots
• A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times
• A survey of scheduling problems with setup times or costs
• An efficient cost scaling algorithm for the assignment problem
• An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
• Complexity results for flow-shop problems with a single server
• scientific article; zbMATH DE number 91757 (Why is no real title available?)
• scientific article; zbMATH DE number 2109192 (Why is no real title available?)
• Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop
• Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem.
• Lower bounds for minimizing total completion time in a two-machine flow shop
• Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
• Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
• Permutation flow shops with exact time lags to minimise maximum lateness
• Polynomial lower bounds for the two-machine flowshop problem with sequence-independent setup times
• Revisiting branch and bound search strategies for machine scheduling problems
• Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
• The significance of reducing setup times/setup costs
• 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
• Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications

Cited in

(13)

• Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times
• Solving permutation flow shop scheduling problem with sequence-independent setup time
• Polynomial lower bounds for the two-machine flowshop problem with sequence-independent setup times
• The third comprehensive survey on scheduling problems with setup times/costs
• Green scheduling of a two-machine flowshop: trade-off between makespan and energy consumption
• The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation
• An assignment-based lower bound for a class of two-machine flow shop problems
• A mixed integer programming approach for the single machine problem with unequal release dates
• Lower bounds for the two-machine flow shop problem with time delays
• scientific article; zbMATH DE number 5247431 (Why is no real title available?)
• Comments on ``A bicriteria \(m\)-machine flowshop scheduling with sequence-dependent setup times
• Two-machine job shop problem with a single server and sequence-independent non-anticipatory set-up times
• Improved algorithms for the two-machine flow shop scheduling problem with uncertain setup times to minimize total tardiness

This page was built for publication: The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies

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