A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan

DOI10.1016/J.COR.2014.06.014MaRDI QIDQ337146zbMATHOpenAlexFDO

Authors Peihai Liu, Xiwen Lu

Publication date 10 November 2016

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

Full work available at URL https://doi.org/10.1016/j.cor.2014.06.014

zbMATH Keywords

onlineschedulingcompetitive ratioflow shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• On-line and semi-online scheduling for flow shop problems on two machines
• scientific article; zbMATH DE number 895359
• On-line scheduling of two-machine open shops where jobs arrive over time
• A best online algorithm for scheduling on two parallel batch machines
• On-line scheduling on parallel machines to minimize the makespan

Cites work

• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates.
• An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times
• Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates
• Approximability of flow shop scheduling
• Minimising makespan in the two-machine flow-shop with release times
• On-line scheduling of two-machine open shops where jobs arrive over time
• Optimal two- and three-stage production schedules with set-up time included

Cited in

(4)

• A simulation-optimization framework for generating dynamic dispatching rules for stochastic job shop with earliness and tardiness penalties
• Online scheduling of ordered flow shops
• On two-machine flow shop scheduling
• On-line and semi-online scheduling for flow shop problems on two machines

This page was built for publication: A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan

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