A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan
DOI10.1016/J.COR.2014.06.014zbMATH Open1348.90288OpenAlexW2063910010MaRDI QIDQ337146FDOQ337146
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
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
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)
Cites Work
- Title not available (Why is that?)
- Optimal two- and three-stage production schedules with set-up time included
- 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
- 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.
Cited In (1)
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)
