Stochastically minimizing total flowtime in flowshops with no waiting space

DOI10.1016/S0377-2217(97)00438-4zbMATH Open0933.90024OpenAlexW2022113174MaRDI QIDQ1806645FDOQ1806645

Ali Allahverdi

Publication date: 8 November 1999

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00438-4

Recommendations

• Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function
• Scheduling in stochastic flowshops with independent setup, processing and removal times
• Two-machine ordered flowshop scheduling under random breakdowns
• Stochastic flowshop no-wait scheduling

zbMATH Keywords

schedulingflowtimerandom breakdownstwo-machine flowshopzero storage space

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness
• Flowshop and Jobshop Schedules: Complexity and Approximation
• Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
• Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties
• Two-machine ordered flowshop scheduling under random breakdowns
• Two-Stage Production Scheduling with Separated Set-up Times and Stochastic Breakdowns
• Heuristic algorithms for continuous flow-shop problem
• Solvable Cases of the No-wait Flow-shop Scheduling Problem
• Single-machine scheduling subject to stochastic breakdowns
• Minimizing the Expected Makespan in Stochastic Flow Shops
• Stochastically minimizing the makespan in flow shops
• Scheduling in stochastic flowshops with independent setup, processing and removal times
• Title not available (Why is that?)
• Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function
• Schedulingn nonoverlapping jobs and two stochastic jobs in a flow shop
• On Pinedo's Conjecture for Scheduling in a Stochastic Flow Shop
• Title not available (Why is that?)

Cited In (7)

• Stochastically minimizing total penalty costs in stochastic flow shops
• Job flow-time in a job shop subject to machine breakdowns with applications in modelling job shop in-process inventories
• Title not available (Why is that?)
• A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures
• Schedule execution for two-machine flow-shop with interval processing times
• Two-machine stochastic flow shops with blocking and the traveling salesman problem
• Minimizing total tardiness in no-wait flowshops

This page was built for publication: Stochastically minimizing total flowtime in flowshops with no waiting space

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