A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation

DOI10.1016/J.EJOR.2004.08.045zbMath1079.90070OpenAlexW1979938554MaRDI QIDQ2572847

Jerzy Kamburowski, Pawel Jan Kalczynski

Publication date: 4 November 2005

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

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

zbMATH Keywords

Weibull distributionFlow shopHeuristicStochastic schedulingCoefficient of variationExpected makespan

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36)

Related Items (10)

Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times ⋮ A mathematical programming approach to sample coefficient of variation with interval-valued observations ⋮ On heuristic solutions for the stochastic flowshop scheduling problem ⋮ A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs ⋮ Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times ⋮ Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness ⋮ Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times ⋮ Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time ⋮ A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times ⋮ Heuristic for stochastic online flowshop problem with preemption penalties

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• RANLUX: A Fortran implementation of the high-quality pseudorandom number generator of Lüscher
• Stochastically minimizing the makespan in two-machine flow shops without blocking
• Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops
• Optimal two- and three-stage production schedules with setup times included
• Makespan-related criteria for comparing schedules in stochastic environments
• On Johnson's Two-Machine Flow Shop with Random Processing Times
• The Complexity of Flowshop and Jobshop Scheduling
• A generalized Johnson's rule for stochastic assembly systems
• Two-machine flowshop minimum-length scheduling problem with random and bounded processing times
• Evaluating Project Completion Times When Activity Times are Erlang Distributed
• Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop

This page was built for publication: A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation