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

DOI10.1016/J.COR.2014.06.014zbMath1348.90288OpenAlexW2063910010MaRDI QIDQ337146

Peihai Liu, Xi-wen 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

schedulingcompetitive ratioflow shoponline

Mathematics Subject Classification ID

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

Related Items (1)

A simulation-optimization framework for generating dynamic dispatching rules for stochastic job shop with earliness and tardiness penalties

Cites Work

• Unnamed Item
• Approximability of flow shop scheduling
• On-line scheduling of two-machine open shops where jobs arrive over time
• An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times
• Optimal two- and three-stage production schedules with setup times included
• Minimising makespan in the two-machine flow-shop with release times
• Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates
• A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates.

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