Single-machine common due-window assignment and scheduling with position-dependent weights, delivery time, learning effect and resource allocations
DOI10.1007/s12190-024-02023-5zbMATH Open1545.9008MaRDI QIDQ6584755
Jin Qian, Xue Zhang, Guisong Chang
Publication date: 8 August 2024
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
schedulingcommon due windowdelivery timelearning effectposition-dependent weightconvex resource allocation
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- Single machine scheduling problems with position-dependent processing times
- The resource dependent assignment problem with a convex agent cost function
- Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects
- Research on single-machine scheduling with position-dependent weights and past-sequence-dependent delivery times
- Improved algorithms for proportionate flow shop scheduling with due-window assignment
- The due date assignment scheduling problem with the deteriorating jobs and delivery time
- A note on study on proportionate flowshop scheduling with due-date assignment and position-dependent weights
- Bicriterion scheduling with group technology and deterioration effect
- A survey of scheduling with controllable processing times
- Single-machine scheduling problems with past-sequence-dependent setup times
- Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date
- Heuristic and exact algorithms for single-machine scheduling problems with general truncated learning effects
- Research on position-dependent weights scheduling with delivery times and truncated sum-of-processing-times-based learning effect
- Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times
- Flow-shop scheduling with a learning effect
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Study on Resource-Dependent No-Wait Flow Shop Scheduling with Different Due-Window Assignment and Learning Effects
- Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint
- Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect
- Due-date assignment scheduling involving job-dependent learning effects and convex resource allocation
- 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
- Common Due Window Assignment Scheduling with Proportional Linear Deterioration Effects
- Single-Machine Scheduling Problems with Variable Processing Times and Past-Sequence-Dependent Delivery Times
- Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs
- Research on m‐machine flow shop scheduling with truncated learning effects
- Flow shop scheduling problem with non-linear learning effects: a linear approximation scheme for non-technical users
- Solution algorithms for single-machine scheduling with learning effects and exponential past-sequence-dependent delivery times
- Single machine slack due window assignment and deteriorating jobs
- Research on delivery times scheduling with truncated learning effects
- Preemptive scheduling of parallel jobs of two sizes with controllable processing times
- Minmax common due-window assignment scheduling with deteriorating jobs
Related Items (1)
This page was built for publication: Single-machine common due-window assignment and scheduling with position-dependent weights, delivery time, learning effect and resource allocations