Scheduling a two-stage flowshop under makespan constraint
From MaRDI portal
Publication:2476691
DOI10.1016/j.mcm.2004.12.016zbMath1170.90389OpenAlexW2021844442MaRDI QIDQ2476691
Publication date: 12 March 2008
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2004.12.016
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
Scheduling multiple two-stage flowshops with a deadline ⋮ Scheduling on multiple two-stage flowshops with a deadline ⋮ A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint ⋮ A memetic algorithm for restoring feasibility in scheduling with limited makespan ⋮ Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The two-machine flowshop scheduling problem with total tardiness
- Scheduling shops to minimize the weighted number of late jobs
- Minimizing tardy jobs in a flowshop with common due date
- Resource-constrained multi-project scheduling with tardy costs: Comparing myopic, bottleneck, and resource pricing heuristics
- Symposium on the theory of scheduling and its applications
- Selecting jobs for heavily loaded shop with lateness penalties
- Optimal two- and three-stage production schedules with setup times included
- The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
This page was built for publication: Scheduling a two-stage flowshop under makespan constraint
