Single-machine group scheduling problems with deteriorated and learning effect
From MaRDI portal
Publication:972174
DOI10.1016/j.amc.2010.02.018zbMath1187.90147OpenAlexW2016972373MaRDI QIDQ972174
Publication date: 25 May 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2010.02.018
makespangroup technologytotal completion timemaximum latenessdeteriorated and learning effectsingle-scheduling
Related Items (21)
Workforce planning incorporating skills: state of the art ⋮ Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan ⋮ An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes ⋮ Single-machine group scheduling problems with variable job processing times ⋮ The study of group scheduling problems with general dual-position-based job processing times ⋮ The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect ⋮ Single-machine scheduling CON/SLK due window assignment problems with sum-of-processed times based learning effect ⋮ A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs ⋮ The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times ⋮ Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs ⋮ A note on machine scheduling with sum-of-logarithm-processing-time-based and position-based learning effects ⋮ Single-machine group scheduling with deteriorating jobs and allotted resource ⋮ Single machine group scheduling with decreasing time-dependent processing times subject to release dates ⋮ Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times ⋮ A note on single-machine scheduling with general learning effect and past-sequence-dependent setup time ⋮ Group scheduling with learning effect and random processing time ⋮ Single machine serial-batching scheduling with independent setup time and deteriorating job processing times ⋮ Two-agent scheduling with position-based deteriorating jobs and learning effects ⋮ A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times ⋮ Uncertain single-machine scheduling with deterioration and learning effect ⋮ A Note on Scheduling Jobs with Extended Sum-of-Processing-Times-Based and Position-Based Learning Effect
Cites Work
- Unnamed Item
- Unnamed Item
- The complexity of scheduling starting time dependent tasks with release times
- Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan
- Time-dependent scheduling
- A note on single-machine group scheduling problems with position-based learning effect
- Single-machine scheduling problems with a learning effect
- Single-machine scheduling with learning considerations
- Single-machine group scheduling problems with deterioration consideration
- Minimizing total tardiness in a scheduling problem with a learning effect
- Learning and forgetting effects on a group scheduling problem
- A state-of-the-art review on scheduling with learning effects
- SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
- Scheduling Deteriorating Jobs on a Single Processor
- A note on single-machine group scheduling problem with a general learning function
- Note on scheduling with general learning curves to minimize the number of tardy jobs
- Single Machine Group Scheduling with Two Ordered Criteria
- A note on scheduling problems with learning effect and deteriorating jobs
- Scheduling problems with a learning effect
This page was built for publication: Single-machine group scheduling problems with deteriorated and learning effect
