A Bicriteria Scheduling Problem with a Learning Effect: Total Completion Time and Total Tardiness
From MaRDI portal
Publication:6102812
DOI10.3138/infor.45.2.75OpenAlexW1969321126MaRDI QIDQ6102812
Publication date: 9 May 2023
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3138/infor.45.2.75
bicriteria schedulingtabu searchmathematical programmingsingle machine schedulinglearning effectheuristic method
Related Items (12)
Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times ⋮ Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning ⋮ Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect ⋮ Several single-machine scheduling problems with general learning effects ⋮ Single-machine due-window assignment problem with learning effect and deteriorating jobs ⋮ Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects ⋮ A bicriteria \(m\)-machine flowshop scheduling with sequence-dependent setup times ⋮ A due-date assignment problem with learning effect and deteriorating jobs ⋮ Scheduling jobs with position and sum-of-processing-time based processing times ⋮ Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect ⋮ Less is more approach for competing groups scheduling with different learning effects ⋮ A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect
Cites Work
- Unnamed Item
- Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan
- Minimizing the makespan in a single machine scheduling problem with a time-based learning effect
- Single-machine scheduling with learning considerations
- Future paths for integer programming and links to artificial intelligence
- Scheduling with general job-dependent learning curves.
- A bi-criterion single-machine scheduling problem with learning considerations
- Common due date scheduling with autonomous and induced learning
- Minimizing total tardiness in a scheduling problem with a learning effect
- Single-machine group scheduling with a time-dependent learning effect
- Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
- Minimizing Total Tardiness on One Machine is NP-Hard
- Note on scheduling with general learning curves to minimize the number of tardy jobs
- Single machine scheduling with learning effect considerations
- Scheduling problems with a learning effect
This page was built for publication: A Bicriteria Scheduling Problem with a Learning Effect: Total Completion Time and Total Tardiness