A Due-Window Determination In Minmax Scheduling Problems

DOI10.1080/03155986.2001.11732429MaRDI QIDQ5888194zbMATH OpenOpenAlexFDO

Authors Gur Mosheiov

Publication date 24 April 2023

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.2001.11732429

zbMATH Keywords

deterministic schedulingdue-windowheuristics

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• Minmax scheduling problems with a common due-window
• Due window scheduling for parallel machines
• Soft due window assignment and scheduling of unit-time jobs on parallel machines
• Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs
• Scheduling with a common due-window: polynomially solvable cases

Cited in

(11)

• Minmax scheduling problems with a common due-window
• Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection
• Minmax scheduling and due-window assignment with position-dependent processing times and job rejection
• A survey on scheduling problems with due windows
• Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times
• scientific article; zbMATH DE number 3906215 (Why is no real title available?)
• Experimental and Efficient Algorithms
• Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine
• A note: minmax due-window assignment with fixed earliness-tardiness costs
• Minmax common due-window assignment scheduling with deteriorating jobs
• Single-machine scheduling with mixed due-windows and deterioration effects

This page was built for publication: A Due-Window Determination In Minmax Scheduling Problems

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