A greedy heuristic for solving scheduling problems with bounded rejection cost

DOI10.1016/J.COR.2022.105827OpenAlexW4221103730MaRDI QIDQ2147117FDOQ2147117

Authors: Matan Atsmony, Gur Mosheiov 

Publication date: 22 June 2022

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

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

Recommendations

• Single machine scheduling with rejection to minimize the weighted makespan
• Single-machine scheduling under the job rejection constraint
• Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
• Single machine scheduling with release dates and rejection
• One scheduling problem with rejection

zbMATH Keywords

dynamic programmingheuristicschedulingsingle machinejob-rejection

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• A survey on offline scheduling with rejection
• Single-machine scheduling under the job rejection constraint
• On the complexity of generalized due date scheduling problems
• Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine
• A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
• Title not available (Why is that?)
• A note on the SPT heuristic for solving scheduling problems with generalized due dates
• Single machine scheduling with assignable due dates
• Two-agent single-machine scheduling with assignable due dates
• Theory and Applications of Models of Computation
• Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection
• A new class of scheduling criteria and their optimization
• Minmax scheduling and due-window assignment with position-dependent processing times and job rejection
• On the minmax common-due-date problem: extensions to position-dependent processing times, job rejection, learning effect, uniform machines and flowshops
• On the parameterized tractability of single machine scheduling with rejection
• Single machine lot scheduling with optional job-rejection
• Regular scheduling measures on proportionate flowshop with job rejection

Cited In (4)

• Title not available (Why is that?)
• Due-date assignment with acceptable lead-times on parallel machines
• Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
• Extending Graham's result on scheduling to other heuristics

This page was built for publication: A greedy heuristic for solving scheduling problems with bounded rejection cost

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