Single-Machine Scheduling Problems with Variable Processing Times and Past-Sequence-Dependent Delivery Times

DOI10.1142/S0217595921500135zbMath1490.90137OpenAlexW3135868442MaRDI QIDQ5865915

Jing Xue, Bo Cui, Ji-Bo Wang, Ming Gao

Publication date: 10 June 2022

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595921500135

zbMATH Keywords

schedulingresource allocationlearning effectdelivery timesdeterioration effect

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (4)

Approaches to Solving Scheduling with Due-Window Assignment and Deterioration Effects ⋮ Solution algorithms for single-machine scheduling with learning effects and exponential past-sequence-dependent delivery times ⋮ Research on delivery times scheduling with truncated learning effects ⋮ Research on position-dependent weights scheduling with delivery times and truncated sum-of-processing-times-based learning effect

Cites Work

• New results on single-machine scheduling with past-sequence-dependent delivery times
• Single-machine scheduling with past-sequence-dependent delivery times and release times
• Models and algorithms of time-dependent scheduling
• Single machine due window assignment resource allocation scheduling with job-dependent learning effect
• Parallel-machine scheduling with past-sequence-dependent delivery times and learning effect
• Research on single-machine scheduling with position-dependent weights and past-sequence-dependent delivery times
• Research on no-idle permutation flowshop scheduling with time-dependent learning effect and deteriorating jobs
• A survey of scheduling with controllable processing times
• Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times
• Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects
• Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times
• SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE
• A note on resource allocation scheduling with position-dependent workloads
• Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint
• Bicriterion scheduling with truncated learning effects and convex controllable processing times
• Research on m‐machine flow shop scheduling with truncated learning effects

This page was built for publication: Single-Machine Scheduling Problems with Variable Processing Times and Past-Sequence-Dependent Delivery Times