Single-machine common due window assignment and scheduling to minimize the total cost
From MaRDI portal
Publication:1941535
DOI10.1016/j.disopt.2012.10.003zbMath1258.90046OpenAlexW2088641949MaRDI QIDQ1941535
Yunqiang Yin, Chin-Chia Wu, Jia-Yin Wang, Cheng, T. C. Edwin
Publication date: 13 March 2013
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2012.10.003
Related Items (9)
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 ⋮ Optimization for due-window assignment scheduling with position-dependent weights ⋮ Two-stage medical supply chain scheduling with an assignable common due window and shelf life ⋮ Single-machine scheduling with piece-rate maintenance and interval constrained position-dependent processing times ⋮ Bicriterion scheduling with a negotiable common due window and resource-dependent processing times ⋮ Parallel-Machine Scheduling to Minimize Flowtime, Holding, and Batch Delivery Costs ⋮ Improved algorithms for single-machine common due window assignment and scheduling with batch deliveries ⋮ An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time
This page was built for publication: Single-machine common due window assignment and scheduling to minimize the total cost
