Single machine scheduling problems with general position-dependent processing times and past-sequence-dependent delivery times
From MaRDI portal
Publication:2511457
DOI10.1007/s12190-013-0722-9zbMath1304.90108OpenAlexW2018360920MaRDI QIDQ2511457
Publication date: 5 August 2014
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-013-0722-9
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs ⋮ Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects ⋮ Research on single-machine scheduling with position-dependent weights and past-sequence-dependent delivery times ⋮ Scheduling problems with effects of deterioration and truncated job-dependent learning
Cites Work
- New results on single-machine scheduling with past-sequence-dependent delivery times
- Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times
- Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times
- A note on scheduling deteriorating jobs
- Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan
- Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
- Single-machine scheduling with learning considerations
- Scheduling with general job-dependent learning curves.
- A bi-criterion single-machine scheduling problem with learning considerations
- Simple matching vs linear assignment in scheduling models with positional effects: a critical review
- Proportionate flowshops with general position-dependent processing times
- A state-of-the-art review on scheduling with learning effects
- Common due window size and location determination in a single machine scheduling problem
- Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect
- Minimizing Variation of Flow Time in Single Machine Systems
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Parallel machine scheduling with a learning effect
- Scheduling jobs with position-dependent processing times
- Scheduling jobs under an aging effect
- Single Machine Scheduling with Flow Allowances
- Scheduling problems with a learning effect
