Two-machine flow-shop scheduling with rejection

DOI10.1016/j.cor.2011.05.023zbMath1251.90186OpenAlexW1983735711MaRDI QIDQ1762086

Dvir Shabtay, Nufar Gasper

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.2011.05.023

zbMATH Keywords

approximation algorithmNP-hardbicriteria optimizationFPTASscheduling with rejectionpseudo-polynomial time algorithmflow-shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (18)

Two-machine open-shop scheduling with rejection to minimize the makespan ⋮ New results on two-machine flow-shop scheduling with rejection ⋮ A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization ⋮ A general scheme for solving a large set of scheduling problems with rejection in FPT time ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ A note: minmax due-date assignment problem with lead-time cost ⋮ A note on ``Two-machine flow-shop scheduling with rejection and its link with flow-shop scheduling and common due date assignment ⋮ Single-machine scheduling with production and rejection costs to minimize the maximum earliness ⋮ A survey on offline scheduling with rejection ⋮ Due-window assignment scheduling with job-rejection, truncated learning effects and setup times ⋮ Proportionate Flow Shop Scheduling with Rejection ⋮ Single-machine scheduling and due date assignment with rejection and position-dependent processing times ⋮ Scheduling on parallel identical machines with job-rejection and position-dependent processing times ⋮ On two-machine flow shop scheduling ⋮ Non-permutation flow shop scheduling with order acceptance and weighted tardiness ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ A constraint generation approach for two-machine shop problems with jobs selection ⋮ TWO-MACHINE FLOW SHOP SCHEDULING WITH INDIVIDUAL OPERATION'S REJECTION

Cites Work

• Unnamed Item
• Unnamed Item
• A bicriteria approach to scheduling a single machine with job rejection and positional penalties
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
• Scheduling linear deteriorating jobs with rejection on a single machine
• Bounded single-machine parallel-batch scheduling with release dates and rejection
• A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
• Single machine scheduling with release dates and rejection
• Scheduling with rejection and non-identical job arrivals
• Optimal two- and three-stage production schedules with setup times included
• An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
• Scheduling with Rejection to Minimize the Makespan
• Algorithms for Scheduling Independent Tasks
• The Complexity of Flowshop and Jobshop Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Techniques for scheduling with rejection
• Theory and Applications of Models of Computation
• Algorithms and Data Structures

This page was built for publication: Two-machine flow-shop scheduling with rejection