A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
DOI10.1016/J.COR.2018.10.006zbMATH Open1458.90281OpenAlexW2898049951WikidataQ129099169 ScholiaQ129099169MaRDI QIDQ1628126FDOQ1628126
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
Recommendations
- Single machine scheduling with release dates and rejection
- Single-machine scheduling under the job rejection constraint
- The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
- A bicriteria approach to scheduling a single machine with job rejection and positional penalties
- Single machine scheduling with rejection to minimize the weighted makespan
dynamic programmingscheduling with rejectiontotal tardinessbranch-and-boundbi-objective optimization
Multi-objective and goal programming (90C29) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A survey on offline scheduling with rejection
- Multiobjective optimization. Interactive and evolutionary approaches
- Single-machine scheduling under the job rejection constraint
- Two-machine flow-shop scheduling with rejection
- Revised delivery-time quotation in scheduling with tardiness penalties
- Minimizing Total Tardiness on One Machine is NP-Hard
- A bicriteria approach to scheduling a single machine with job rejection and positional penalties
- Bound sets for biobjective combinatorial optimization problems
- Title not available (Why is that?)
- Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- Enumeration of Pareto optima for a flowshop scheduling problem with two criteria
- Finding the Pareto-optima for the total and maximum tardiness single machine problem
- Multi-objective branch and bound
- A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization
Cited In (16)
- On the mass COVID-19 vaccination scheduling problem
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
- Scheduling with competing agents, total late work and job rejection
- Online single-processor scheduling with an unexpected breakdown
- The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
- A greedy heuristic for solving scheduling problems with bounded rejection cost
- Order assignment and scheduling under processing and distribution time uncertainty
- Online scheduling with deterioration and unexpected processor breakdown
- Single machine lot scheduling with optional job-rejection
- Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
- 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
- Single machine scheduling to minimize maximum earliness/tardiness cost with job 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
- A Semi-Online Algorithm for Single Machine Scheduling with Rejection
Uses Software
This page was built for publication: A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1628126)
