Scheduling a two-stage flowshop under makespan constraint

DOI10.1016/J.MCM.2004.12.016MaRDI QIDQ2476691zbMATH OpenOpenAlexFDO

Authors Yanyan Li

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

zbMATH Keywords

approximation algorithmsflowshopheuristicsscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Optimal scheduling of a two-stage hybrid flow shop
• Two-Stage, Hybrid Flowshop Scheduling Problem
• Scheduling a two-stage hybrid flow shop with parallel machines at the first stage
• A two-machine flow shop scheduling problem with controllable job processing times
• A constraint generation approach for two-machine shop problems with jobs selection

Cites work

• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• scientific article; zbMATH DE number 5345853 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming
• Minimizing tardy jobs in a flowshop with common due date
• Optimal two- and three-stage production schedules with set-up time included
• Resource-constrained multi-project scheduling with tardy costs: Comparing myopic, bottleneck, and resource pricing heuristics
• Scheduling shops to minimize the weighted number of late jobs
• Selecting jobs for heavily loaded shop with lateness penalties
• Symposium on the theory of scheduling and its applications
• The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem
• The two-machine flowshop scheduling problem with total tardiness

Cited in

(15)

• Job selection in a heavily loaded shop
• A constraint generation approach for two-machine shop problems with jobs selection
• Two-stage proportionate flexible flow shop to minimize the makespan
• Scheduling multiple two-stage flowshops with a deadline
• Scheduling on multiple two-stage flowshops with a deadline
• Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage
• Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times
• Scheduling two-stage jobs on multiple flowshops
• A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint
• scientific article; zbMATH DE number 5631252 (Why is no real title available?)
• Group scheduling in a two-stage flowshop
• Flowshop-scheduling problems with makespan criterion: a review
• A memetic algorithm for restoring feasibility in scheduling with limited makespan
• Improved approximation algorithms for the multiple two-stage knapsack problem
• An algorithm for the maximum revenue jobshop problem

This page was built for publication: Scheduling a two-stage flowshop under makespan constraint

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