Two-machine flow-shop scheduling with rejection

DOI10.1016/J.COR.2011.05.023MaRDI QIDQ1762086zbMATH OpenOpenAlexFDO

Authors 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 algorithmFPTASscheduling with rejectionNP-hardbicriteria optimizationpseudo-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)

Recommendations

• TWO-MACHINE FLOW SHOP SCHEDULING WITH INDIVIDUAL OPERATION'S REJECTION
• New results on two-machine flow-shop scheduling with rejection
• Two-machine open-shop scheduling with rejection to minimize the makespan
• Proportionate flow shop scheduling with rejection
• Two-machine flow-shop scheduling with deterioration and rejection

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 871904 (Why is no real title available?)
• A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
• A bicriteria approach to scheduling a single machine with job rejection and positional penalties
• Algorithms and Data Structures
• Algorithms for Scheduling Independent Tasks
• An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
• Bounded single-machine parallel-batch scheduling with release dates and rejection
• Optimal two- and three-stage production schedules with set-up time included
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling linear deteriorating jobs with rejection on a single machine
• Scheduling with Rejection to Minimize the Makespan
• Scheduling with rejection and non-identical job arrivals
• Single machine scheduling with release dates and rejection
• Techniques for scheduling with rejection
• The Complexity of Flowshop and Jobshop Scheduling
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
• Theory and Applications of Models of Computation

Cited in

(22)

• A survey on offline scheduling with rejection
• Coordinating scheduling and rejection decisions in a two-machine flow shop scheduling problem
• Two-machine open-shop scheduling with rejection to minimize the makespan
• New results on two-machine flow-shop scheduling with rejection
• Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations
• A constraint generation approach for two-machine shop problems with jobs selection
• A general scheme for solving a large set of scheduling problems with rejection in FPT time
• Flowshop scheduling with learning effect and job rejection
• Regular scheduling measures on proportionate flowshop with job rejection
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• 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
• A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
• Scheduling on parallel identical machines with job-rejection and position-dependent processing times
• Due-window assignment scheduling with job-rejection, truncated learning effects and setup times
• TWO-MACHINE FLOW SHOP SCHEDULING WITH INDIVIDUAL OPERATION'S REJECTION
• On two-machine flow shop scheduling
• Proportionate flow shop scheduling with rejection
• Single-machine scheduling with production and rejection costs to minimize the maximum earliness
• Single-machine scheduling and due date assignment with rejection and position-dependent processing times
• Non-permutation flow shop scheduling with order acceptance and weighted tardiness

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

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