Flow Shop Resource Allocation Scheduling with Due Date Assignment, Learning Effect and Position-Dependent Weights
From MaRDI portal
Publication:5149554
DOI10.1142/S0217595920500141zbMATH Open1457.90070OpenAlexW3003402234MaRDI QIDQ5149554FDOQ5149554
Publication date: 11 February 2021
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595920500141
Deterministic scheduling theory in operations research (90B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Cites Work
- A survey of scheduling with controllable processing times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Title not available (Why is that?)
- A state-of-the-art review on scheduling with learning effects
- Title not available (Why is that?)
- No-wait flowshops with bicriteria of makespan and total completion time
- Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs
- Optimal restricted due date assignment in scheduling
- Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times
- A Note on Scheduling Jobs with Extended Sum-of-Processing-Times-Based and Position-Based Learning Effect
- Makespan minimization on three-machine flow shop with deteriorating jobs
- Minimizing makespan in a two-machine flow shop with effects of deterioration and learning
- Optimal due-date assignment problem with learning effect and resource-dependent processing times
- Single machine scheduling with truncated job-dependent learning effect
- Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects
- SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE
- A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times
- Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect
- Proportionate flowshop scheduling with position-dependent weights
- Due-window assignment scheduling problems with position-dependent weights on a single machine
- CON/SLK due date assignment and scheduling on a single machine with two agents
- No-wait flowshops with bicriteria of makespan and maximum lateness.
- Research on m‐machine flow shop scheduling with truncated learning effects
- A note on resource allocation scheduling with position-dependent workloads
- Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents
- Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint
- A Bicriteria Approach for Single Machine Scheduling with Resource Allocation, Learning Effect and a Deteriorating Maintenance Activity
- Outsourcing and scheduling for a two-machine flow shop with release times
Cited In (13)
- Due-window assignment and resource allocation scheduling with truncated learning effect and position-dependent weights
- Permutation flow shop scheduling with makespan objective and truncated learning effects
- Supply chain scheduling with deteriorating jobs and delivery times
- Study on due-date assignment scheduling with setup times and general truncated learning effects
- Single machine slack due window assignment and deteriorating jobs
- A Bicriterion Approach to Due Date Assignment Scheduling in Single-Machine with Position-Dependent Weights
- Heuristic and exact algorithms for single-machine scheduling problems with general truncated learning effects
- Resource allocation scheduling with deteriorating jobs and position-dependent workloads
- Resource dependent scheduling with truncated learning effects
- Solution algorithms for single-machine scheduling with learning effects and exponential past-sequence-dependent delivery times
- Research on position-dependent weights scheduling with delivery times and truncated sum-of-processing-times-based learning effect
- Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect
- Research on delivery times scheduling with sum of logarithm processing times-based learning effect
This page was built for publication: Flow Shop Resource Allocation Scheduling with Due Date Assignment, Learning Effect and Position-Dependent Weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5149554)