Single machine scheduling problems with position-dependent processing times
From MaRDI portal
Publication:1032015
DOI10.1007/s12190-008-0173-xzbMath1172.90409OpenAlexW2053190384MaRDI QIDQ1032015
Dan Wang, Ji-Bo Wang, Wen-Jun Gao, Li-Yan Wang, Na Yin, Xiao Yuan Wang
Publication date: 23 October 2009
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-008-0173-x
Related Items (1)
Cites Work
- Unnamed Item
- Flow shop scheduling with effects of learning and deterioration
- Single-machine scheduling with learning considerations
- 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
- Flow shop scheduling jobs with position-dependent processing times
- Flow-shop scheduling with a learning effect
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling with a learning effect
- Scheduling jobs with position-dependent processing times
- Note on scheduling with general learning curves to minimize the number of tardy jobs
- A note on scheduling problems with learning effect and deteriorating jobs
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Single machine scheduling with learning effect considerations
- Scheduling problems with a learning effect
This page was built for publication: Single machine scheduling problems with position-dependent processing times