Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness

DOI10.1016/0305-0548(96)00012-3MaRDI QIDQ2563893zbMATH OpenOpenAlexFDO

Authors Ali Allahverdi

Publication date 6 January 1997

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0305-0548(96)00012-3

zbMATH Keywords

maximum lateness objective functionrandom breakdownsshortest processing time policytwo-machine proportionate flowshop

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function
• Two-machine ordered flowshop scheduling under random breakdowns
• Single-machine scheduling subject to stochastic breakdowns
• scientific article; zbMATH DE number 640393
• scientific article; zbMATH DE number 830013

Cites work

• Focused Scheduling in Proportionate Flowshops
• scientific article; zbMATH DE number 3425355 (Why is no real title available?)
• scientific article; zbMATH DE number 3471786 (Why is no real title available?)
• scientific article; zbMATH DE number 830013 (Why is no real title available?)
• Job lateness in a two-machine flowshop with setup times separated
• Minimizing Maximum Lateness in a Two-Machine Open Shop
• Minimizing the Expected Makespan in Stochastic Flow Shops
• On Johnson's Two-Machine Flow Shop with Random Processing Times
• On two-machine scheduling with release and due dates to minimize maximum lateness
• 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
• Single-machine scheduling subject to stochastic breakdowns
• Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties
• Stochastically minimizing the makespan in flow shops
• Two-machine ordered flowshop scheduling under random breakdowns
• Two-Stage Production Scheduling with Separated Set-up Times and Stochastic Breakdowns

Cited in

(17)

• Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
• Scheduling in stochastic flowshops with independent setup, processing and removal times
• Scheduling under machine breakdown in a continuous process industry
• Stochastically minimizing total flowtime in flowshops with no waiting space
• A note on makespan minimization in proportionate flow shops
• A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures
• The proportionate two-machine no-wait job shop scheduling problem
• scientific article; zbMATH DE number 3908146 (Why is no real title available?)
• Minimizing makespan for scheduling stochastic job shop with random breakdown
• Minimizing makespan in an ordered flow shop with machine-dependent processing times
• Two-machine flow shop scheduling problem with an outsourcing option
• Two-machine flowshop minimum-length scheduling problem with random and bounded processing times
• Uncertain flexible flow shop scheduling problem subject to breakdowns
• Proportionate flow shop scheduling with rejection
• Two-agent proportionate flowshop scheduling with deadlines: polynomial-time optimization algorithms
• Proportionate flow shop games
• Flow shops with machine maintenance: ordered and proportionate cases

This page was built for publication: Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness

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