Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates
From MaRDI portal
Publication:3705209
DOI10.1287/moor.10.4.576zbMath0582.90055OpenAlexW1986561810MaRDI QIDQ3705209
Publication date: 1985
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.10.4.576
heuristicsworst-case performancemaximum completion timerelease datetwo-machine flow-shop problemwithout preemption
Related Items (17)
Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. ⋮ Outsourcing and scheduling for a two-machine flow shop with release times ⋮ A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan ⋮ Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint ⋮ Two-stage flowshop scheduling with a common second-stage machine ⋮ A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\) ⋮ Optimal control of a two-server flow-shop network ⋮ A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs ⋮ Exact and metaheuristic algorithms for flow-shop scheduling problems with release dates ⋮ Optimal results and numerical simulations for flow shop scheduling problems ⋮ Bicriterion optimization for flow shop with a learning effect subject to release dates ⋮ Two-machine flowshop scheduling in a physical examination center ⋮ Heuristics for a flowshop scheduling problem with stepwise job objective function ⋮ An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times ⋮ A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates. ⋮ Approximation scheduling algorithms: a survey ⋮ On-line and semi-online scheduling for flow shop problems on two machines
This page was built for publication: Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates
