Online scheduling of ordered flow shops

DOI10.1016/j.ejor.2018.06.008zbMath1403.90341OpenAlexW2808294388MaRDI QIDQ1991105

Kangbok Lee, Feifeng Zheng, Michael L. Pinedo

Publication date: 30 October 2018

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

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

zbMATH Keywords

competitive ratiomakespanflow shoponline schedulingbest possible algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Related Items

Online scheduling with deterioration and unexpected processor breakdown ⋮ Discrete and continuous-time formulations for dealing with break periods: preemptive and non-preemptive scheduling ⋮ Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem ⋮ Applying ``peeling onion approach for competitive analysis in online scheduling with rejection ⋮ Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates ⋮ An optimal online algorithm for single-processor scheduling problem with learning effect ⋮ A Semi-Online Algorithm for Single Machine Scheduling with Rejection

Cites Work

• Unnamed Item
• Unnamed Item
• Proportionate flow shop games
• Flow shops with machine maintenance: ordered and proportionate cases
• The three-machine proportionate flow shop problem with unequal machine speeds
• Optimal two- and three-stage production schedules with setup times included
• On-line and semi-online scheduling for flow shop problems on two machines
• Review of the ordered and proportionate flow shop scheduling research
• Focused Scheduling in Proportionate Flowshops
• Minimizing the Expected Makespan in Stochastic Flow Shops
• Flowshop Sequencing Problem with Ordered Processing Time Matrices
• Flowshop and Jobshop Schedules: Complexity and Approximation
• Scheduling