Online scheduling of ordered flow shops

DOI10.1016/J.EJOR.2018.06.008MaRDI QIDQ1991105zbMATH OpenOpenAlexWikidataFDO

Authors 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

best possible algorithmcompetitive ratioflow shopmakespanonline scheduling

Mathematics Subject Classification ID

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

Recommendations

• Online algorithms to schedule a proportionate flexible flow shop of batching machines
• A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan
• On-line and semi-online scheduling for flow shop problems on two machines
• scientific article; zbMATH DE number 895359
• On-line scheduling of parallel jobs on two machines

Cites work

• Flow shops with machine maintenance: ordered and proportionate cases
• Flowshop and Jobshop Schedules: Complexity and Approximation
• Flowshop Sequencing Problem with Ordered Processing Time Matrices
• Focused Scheduling in Proportionate Flowshops
• scientific article; zbMATH DE number 3425355 (Why is no real title available?)
• scientific article; zbMATH DE number 895359 (Why is no real title available?)
• Minimizing the Expected Makespan in Stochastic Flow Shops
• On-line and semi-online scheduling for flow shop problems on two machines
• Optimal two- and three-stage production schedules with set-up time included
• Proportionate flow shop games
• Review of the ordered and proportionate flow shop scheduling research
• Scheduling. Theory, algorithms, and systems
• The three-machine proportionate flow shop problem with unequal machine speeds

Cited in

(12)

• Competitive algorithms for multistage online scheduling
• Discrete and continuous-time formulations for dealing with break periods: preemptive and non-preemptive scheduling
• Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
• An optimal online algorithm for single-processor scheduling problem with learning effect
• Online algorithms to schedule a proportionate flexible flow shop of batching machines
• Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem
• A semi-online algorithm for single machine scheduling with rejection
• Two-machine ordered flow shop scheduling with generalized due dates
• Online scheduling with deterioration and unexpected processor breakdown
• Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits
• Online single-processor scheduling with an unexpected breakdown
• Online early work scheduling on parallel machines

This page was built for publication: Online scheduling of ordered flow shops

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