Minmax scheduling and due-window assignment with position-dependent processing times and job rejection

DOI10.1007/s10288-019-00418-wzbMath1464.90028OpenAlexW2971245531MaRDI QIDQ2026708

Gur Mosheiov, Vitaly A. Strusevich, Assaf Sarig

Publication date: 20 May 2021

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-019-00418-w

zbMATH Keywords

schedulingsequencingdue-window assignmentposition-dependent processing timesproportionate flow shopjob-rejection

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 (6)

A greedy heuristic for solving scheduling problems with bounded rejection cost ⋮ Single machine scheduling with non-availability interval and optional job rejection ⋮ Scheduling with competing agents, total late work and job rejection ⋮ Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine ⋮ Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times ⋮ Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection

Cites Work

• Unnamed Item
• Improved algorithms for single machine scheduling with release dates and rejections
• Parallel-machine scheduling with release dates and rejection
• The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
• A survey on offline scheduling with rejection
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
• Scheduling linear deteriorating jobs with rejection on a single machine
• Single-machine scheduling under the job rejection constraint
• Minmax scheduling problems with a common due-window
• Bounded single-machine parallel-batch scheduling with release dates and rejection
• Single machine scheduling with release dates and rejection
• Single-machine scheduling with learning considerations
• A note on scheduling on a single processor with speed dependent on a number of executed jobs
• A concise survey of scheduling with time-dependent processing times
• A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
• Soft due window assignment and scheduling of unit-time jobs on parallel machines
• Proportionate flowshops with general position-dependent processing times
• Scheduling with a common due-window: polynomially solvable cases
• Some scheduling problems with general position-dependent and time-dependent learning effects
• Scheduling with rejection and non-identical job arrivals
• An improved heuristic for parallel machine scheduling with rejection
• A survey on scheduling problems with due windows
• Review of the ordered and proportionate flow shop scheduling research
• An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
• Algorithms for two bottleneck optimization problems
• A Due-Window Determination In Minmax Scheduling Problems
• Theory and Applications of Models of Computation
• Algorithms and Data Structures
• A common due-data assignment problem on parallel identical machines

This page was built for publication: Minmax scheduling and due-window assignment with position-dependent processing times and job rejection