A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem

DOI10.1287/MOOR.19.1.68MaRDI QIDQ4294730zbMATH OpenOpenAlexFDO

Authors Leslie A. Hall

Publication date 27 September 1995

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.19.1.68

zbMATH Keywords

greedy heuristicmakespanmaximum completion timepolynomial approximationrelease datestwo-machine flow shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\)
• Efficient approximation schemes for scheduling problems with release dates and delivery times
• PTAS for a two-machine flow-shop scheduling problem with release dates and transportation times delay
• A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
• A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates.

Cited in

(15)

• Two-machine flowshop scheduling with availability constraints
• Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times.
• Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
• A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
• A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\)
• Two-machine flowshop scheduling in a physical examination center
• An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times
• An approximability result of the multi-vehicle scheduling problem on a path with release and handling times
• scientific article; zbMATH DE number 1731178 (Why is no real title available?)
• A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility
• scientific article; zbMATH DE number 4170628 (Why is no real title available?)
• PTAS for a two-machine flow-shop scheduling problem with release dates and transportation times delay
• A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates.
• Polynomial-time approximation schemes for scheduling problems with time lags
• Optimal control of a two-server flow-shop network

This page was built for publication: A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem

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