A note on the single machine CON and CONW problems with lot scheduling

DOI10.1007/S10878-021-00709-1zbMATH Open1478.90043OpenAlexW3134126718MaRDI QIDQ2230735FDOQ2230735

Authors: Baruch Mor, Gur Mosheiov 

Publication date: 28 September 2021

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-021-00709-1

Recommendations

• Scheduling with a common due-window: polynomially solvable cases
• Single-machine scheduling CON/SLK due window assignment problems with sum-of-processed times based learning effect
• CON due-date determination and sequencing
• Minmax scheduling problems with a common due-window
• Lot scheduling on a single machine to minimize the (weighted) number of tardy orders

zbMATH Keywords

dynamic programmingsingle machinecommon due-datelot schedulingcommon due-window

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Cites Work

• A survey of the state-of-the-art of common due date assignment and scheduling research
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• A survey on scheduling problems with due windows
• Common due window size and location determination in a single machine scheduling problem
• Lot scheduling on a single machine
• Determination of common due window location in a single machine scheduling problem
• A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
• Minmax scheduling problems with common due-date and completion time penalty
• Single-machine lot scheduling with variable lot processing times
• Single machine lot scheduling to minimize the total weighted (discounted) completion time
• Lot scheduling on a single machine to minimize the (weighted) number of tardy orders
• Two-stage medical supply chain scheduling with an assignable common due window and shelf life
• Single machine lot scheduling with optional job-rejection
• Single-machine common due date total earliness/tardiness scheduling with machine unavailability
• Research on common due window assignment flowshop scheduling with learning effect and resource allocation

Cited In (4)

• A note on lot scheduling on a single machine to minimize maximum weighted tardiness
• A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times
• Approaches to Solving Scheduling with Due-Window Assignment and Deterioration Effects
• Polynomial time algorithms to find Pareto optimal schedules of bicriteria lot scheduling problems with splitable jobs on a single parallel-batch machine

This page was built for publication: A note on the single machine CON and CONW problems with lot scheduling

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