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

DOI10.1016/J.EJOR.2013.05.031zbMATH Open1317.90121OpenAlexW2022025030MaRDI QIDQ2356207FDOQ2356207

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

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

zbMATH Keywords

lower boundsschedulingLagrangian relaxationtotal completion timetwo-machine flowshopsequence-independent setup times

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (12)

• Lower bounds for the two-machine flow shop problem with time delays
• Title not available (Why is that?)
• Two-machine job shop problem with a single server and sequence-independent non-anticipatory set-up times
• 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
• Comments on ``A bicriteria \(m\)-machine flowshop scheduling with sequence-dependent setup times
• A mixed integer programming approach for the single machine problem with unequal release dates
• Solving permutation flow shop scheduling problem with sequence-independent setup time
• Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times

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)