An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times
From MaRDI portal
Publication:1761212
DOI10.1016/j.cor.2012.01.011zbMath1251.90154MaRDI QIDQ1761212
Jerzy Kamburowski, Pawel Jan Kalczynski
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.01.011
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hard dial-a-ride problem that is easy on average
- Some efficient heuristic methods for the flow shop sequencing problem
- An empirical analysis of the optimality rate of flow shop heuristics
- Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times.
- A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\)
- Testing heuristics: We have it all wrong
- Optimal two- and three-stage production schedules with setup times included
- Minimising makespan in the two-machine flow-shop with release times
- Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates
- Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops
- The Average number of pivot steps required by the Simplex-Method is polynomial
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem
- A Probabilistic Analysis of Two-Machine Flowshops
- Some simple scheduling algorithms
- The effectiveness of the longest delivery time rule for the flow shop delivery time problem
- Minimizing maximum lateness in a flow shop subject to release dates
- Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems
- Random knapsack in expected polynomial time
- A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times
- A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates.
