A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization

DOI10.1016/j.cor.2018.10.006zbMath1458.90281OpenAlexW2898049951WikidataQ129099169 ScholiaQ129099169MaRDI QIDQ1628126

Roberto Cordone, Pierre Hosteins

Publication date: 3 December 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.10.006

zbMATH Keywords

dynamic programmingbranch-and-boundtotal tardinessscheduling with rejectionbi-objective optimization

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Related Items (14)

A greedy heuristic for solving scheduling problems with bounded rejection cost ⋮ A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection ⋮ A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach ⋮ Scheduling with competing agents, total late work and job rejection ⋮ On the mass COVID-19 vaccination scheduling problem ⋮ Online scheduling with deterioration and unexpected processor breakdown ⋮ Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection ⋮ Single machine lot scheduling with optional job-rejection ⋮ Applying ``peeling onion approach for competitive analysis in online scheduling with rejection ⋮ New results for scheduling to minimize tardiness on one machine with rejection and related problems ⋮ Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates ⋮ Order assignment and scheduling under processing and distribution time uncertainty ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems ⋮ A Semi-Online Algorithm for Single Machine Scheduling with Rejection

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• A survey on offline scheduling with rejection
• A bicriteria approach to scheduling a single machine with job rejection and positional penalties
• Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
• Bound sets for biobjective combinatorial optimization problems
• Multiobjective optimization. Interactive and evolutionary approaches
• Single-machine scheduling under the job rejection constraint
• Multi-objective branch and bound
• Two-machine flow-shop scheduling with rejection
• Finding the Pareto-optima for the total and maximum tardiness single machine problem
• Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria
• Revised Delivery-Time Quotation in Scheduling with Tardiness Penalties
• Minimizing Total Tardiness on One Machine is NP-Hard
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness

This page was built for publication: A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization