A note on the single machine CON and CONW problems with lot scheduling
From MaRDI portal
Publication:2230735
DOI10.1007/S10878-021-00709-1zbMath1478.90043OpenAlexW3134126718MaRDI QIDQ2230735
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
Related Items (2)
Approaches to Solving Scheduling with Due-Window Assignment and Deterioration Effects ⋮ A note on lot scheduling on a single machine to minimize maximum weighted tardiness
Cites Work
- Lot scheduling on a single machine
- Determination of common due window location in a single machine scheduling problem
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Single machine lot scheduling to minimize the total weighted (discounted) completion time
- Two-stage medical supply chain scheduling with an assignable common due window and shelf life
- A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
- Single machine lot scheduling with optional job-rejection
- Lot scheduling on a single machine to minimize the (weighted) number of tardy orders
- Single-machine common due date total earliness/tardiness scheduling with machine unavailability
- Minmax scheduling problems with common due-date and completion time penalty
- A survey on scheduling problems with due windows
- Common due window size and location determination in a single machine scheduling problem
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Research on common due window assignment flowshop scheduling with learning effect and resource allocation
- Single-machine lot scheduling with variable lot processing times
This page was built for publication: A note on the single machine CON and CONW problems with lot scheduling
