New results on single-machine scheduling with past-sequence-dependent delivery times
From MaRDI portal
Publication:441858
DOI10.1016/j.tcs.2012.03.009zbMath1247.68034OpenAlexW2059037976WikidataQ57185667 ScholiaQ57185667MaRDI QIDQ441858
Chengbin Chu, Feifeng Zheng, Ming Liu, Yin-Feng Xu
Publication date: 8 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.03.009
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (7)
Parallel-machine scheduling problems with past-sequence-dependent delivery times and aging maintenance ⋮ Research on delivery times scheduling with truncated learning effects ⋮ Research on single-machine scheduling with position-dependent weights and past-sequence-dependent delivery times ⋮ Single machine scheduling problems with general position-dependent processing times and past-sequence-dependent delivery times ⋮ Single-Machine Scheduling Problems with Variable Processing Times and Past-Sequence-Dependent Delivery Times ⋮ Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness ⋮ SCHEDULING POSITION-BASED DETERIORATING JOBS WITH MULTIPLE RATE-MODIFYING ACTIVITIES AND PAST-SEQUENCE-DEPENDENT DELIVERY TIMES
Cites Work
- Unnamed Item
- Single-machine scheduling problems with past-sequence-dependent setup times
- Scheduling Deteriorating Jobs on a Single Processor
- Minimizing Variation of Flow Time in Single Machine Systems
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
This page was built for publication: New results on single-machine scheduling with past-sequence-dependent delivery times