Due-date assignment with acceptable lead-times on parallel machines

DOI10.1016/J.COR.2024.106617MaRDI QIDQ6568406zbMATH OpenFDO

Authors Baruch Mor, Gur Mosheiov

Publication date 8 July 2024

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

Full work available at URL https://doi.org/10.1016/J.COR.2024.106617

zbMATH Keywords

due-date assignmentdynamic programming algorithmlead-timeparallel machinesscheduling

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A common due-data assignment problem on parallel identical machines
• A general scheme for solving a large set of scheduling problems with rejection in FPT time
• A greedy heuristic for solving scheduling problems with bounded rejection cost
• A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines
• A note: minmax due-date assignment problem with lead-time cost
• A survey of the state-of-the-art of common due date assignment and scheduling research
• A survey on offline scheduling with rejection
• A unified approach for scheduling with convex resource consumption functions using positional penalties
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Due date assignments and scheduling a single machine with a general earliness/tardiness cost function
• Minmax due-date assignment on a two-machine flowshop
• Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection
• Minsum scheduling with acceptable lead-times and optional job rejection
• Optimal due date assignment in multi-machine scheduling environments
• Optimal restricted due date assignment in scheduling
• Research on single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs
• Scheduling of two-machine flowshop with outsourcing lead-time
• Scheduling with competing agents, total late work and job rejection
• Single machine lot scheduling with optional job-rejection
• Single Machine Scheduling with Flow Allowances
• Single machine scheduling with non-availability interval and optional job rejection
• Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs
• The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
• Two due date assignment problems in scheduling a single machine

Cited in

(1)

• Min-max regret single machine scheduling with due-date assignment and interval processing times

This page was built for publication: Due-date assignment with acceptable lead-times on parallel machines

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