Some single-machine scheduling with sum-of-processing-time-based and job-position-based processing times
From MaRDI portal
Publication:1788956
DOI10.1016/j.apm.2013.01.004zbMath1426.90127OpenAlexW2083590721MaRDI QIDQ1788956
Publication date: 9 October 2018
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2013.01.004
Related Items (7)
Single-machine scheduling CON/SLK due window assignment problems with sum-of-processed times based learning effect ⋮ A simple proof technique for scheduling models with learning effects ⋮ Multi-parallel work centers scheduling optimization with shared or dedicated resources in low-volume low-variety production systems ⋮ Scheduling jobs with position and sum-of-processing-time based processing times ⋮ Single-machine scheduling problems with a learning effect matrix ⋮ Single machine and flowshop scheduling problems with sum-of-processing time based learning phenomenon ⋮ SCHEDULING POSITION-BASED DETERIORATING JOBS WITH MULTIPLE RATE-MODIFYING ACTIVITIES AND PAST-SEQUENCE-DEPENDENT DELIVERY TIMES
Cites Work
- Unnamed Item
- Single-machine scheduling with convex resource dependent processing times and deteriorating jobs
- Scheduling with general position-based learning curves
- Single-machine group scheduling with general deterioration and learning effects
- Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times
- Single-machine scheduling problems with both deteriorating jobs and learning effects
- Single machine quadratic penalty function scheduling with deteriorating jobs and group technology
- Scheduling problems with general effects of deterioration and learning
- Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties
- Single-machine scheduling with a nonlinear deterioration function
- A note on single-machine scheduling with general learning effect and past-sequence-dependent setup time
- Single-machine scheduling with nonlinear deterioration
- The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model
- A note on scheduling deteriorating jobs
- A bicriteria parallel machine scheduling with a learning effect of setup and removal times
- Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration
- Single-machine and two-machine flowshop scheduling with general learning functions
- Time-dependent scheduling
- A scheduling problem with job values given as a power function of their completion times
- A note on single-machine group scheduling problems with position-based learning effect
- Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates
- Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
- Single-machine scheduling with learning considerations
- A concise survey of scheduling with time-dependent processing times
- Scheduling with general job-dependent learning curves.
- Single-machine scheduling with logarithm deterioration
- Single-machine scheduling with time-and-resource-dependent processing times
- Single-machine scheduling with past-sequence-dependent setup times and general effects of deterioration and learning
- Single-machine scheduling with accelerating deterioration effects
- Learning and forgetting effects on a group scheduling problem
- A state-of-the-art review on scheduling with learning effects
- Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
- Multi-machine scheduling with deteriorating jobs and scheduled maintenance
- Scheduling with time dependent processing times: Review and extensions
- A due-window assignment problem with position-dependent processing times
- Minimizing total absolute deviation of job completion times: extensions to position-dependent processing times and parallel identical machines
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling with a learning effect
- Scheduling jobs with position-dependent processing times
- Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs
- Scheduling problems with a learning effect
This page was built for publication: Some single-machine scheduling with sum-of-processing-time-based and job-position-based processing times
