Minmax scheduling problems with a common due-window
From MaRDI portal
Publication:1000973
DOI10.1016/j.cor.2008.06.001zbMath1179.90145OpenAlexW2085706413MaRDI QIDQ1000973
Publication date: 12 February 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.06.001
Related Items
A survey on scheduling problems with due windows, Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation, Due-window assignment scheduling problems with position-dependent weights on a single machine, Research on common due window assignment flowshop scheduling with learning effect and resource allocation, Scheduling problems with two competing agents to minimized weighted earliness-tardiness, Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine, Minmax scheduling problems with common due-date and completion time penalty, Optimization for due-window assignment scheduling with position-dependent weights, Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times, Minmax scheduling and due-window assignment with position-dependent processing times and job rejection, Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times, Study on Resource-Dependent No-Wait Flow Shop Scheduling with Different Due-Window Assignment and Learning Effects, Scheduling problems with a common due window assignment: A survey, Due-window assignment with identical jobs on parallel uniform machines
Cites Work
- Unnamed Item
- Unnamed Item
- A survey of the state-of-the-art of common due date assignment and scheduling research
- A note on a due-date assignment on a two-machine flow-shop
- Common due window size and location determination in a single machine scheduling problem
- Bounds for List Schedules on Uniform Processors
- Due-window assignment with unit processing-time jobs
- A Due-Window Determination In Minmax Scheduling Problems
- Parallel Processing and Applied Mathematics
