Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine
From MaRDI portal
Publication:2253532
DOI10.1016/j.ejor.2012.09.013zbMath1292.90122OpenAlexW2060500675MaRDI QIDQ2253532
Publication date: 27 July 2014
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.09.013
Related Items
Algorithms for single-machine scheduling problem with deterioration depending on a novel model ⋮ Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects ⋮ A survey on scheduling problems with due windows ⋮ An alternative approach for proving the NP-hardness of optimization problems ⋮ Simple matching vs linear assignment in scheduling models with positional effects: a critical review ⋮ Bicriterion scheduling with truncated learning effects and convex controllable processing times ⋮ Group scheduling with general autonomous and induced learning effect ⋮ Scheduling with learning effects and/or time-dependent processing times to minimize the weighted number of tardy jobs on a single machine ⋮ Research on single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs ⋮ Parallel-batching machines scheduling problem with a truncated time-dependent learning effect via a hybrid CS-JADE algorithm ⋮ Due-Window Assignment for a Single Machine Scheduling with Both Deterioration and Positional Effects ⋮ Scheduling problems with effects of deterioration and truncated job-dependent learning ⋮ A computational study of constraint programming approaches for resource-constrained project scheduling with autonomous learning effects
Cites Work
- Unnamed Item
- Unnamed Item
- Manufacturing lead-time rules: customer retention versus tardiness costs
- A note on scheduling deteriorating jobs
- Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
- Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan
- A unified approach for scheduling with convex resource consumption functions using positional penalties
- A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times
- Single-machine scheduling with learning considerations
- A concise survey of scheduling with time-dependent processing times
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Simple matching vs linear assignment in scheduling models with positional effects: a critical review
- Single-machine scheduling with both deterioration and learning effects
- A state-of-the-art review on scheduling with learning effects
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- Scheduling Problems with Learning and Ageing Effects: A Survey
- Common due window size and location determination in a single machine scheduling problem
- SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
- Sequencing with Earliness and Tardiness Penalties: A Review
- Scheduling Deteriorating Jobs on a Single Processor
- Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- V-Shaped Policies for Scheduling Deteriorating Jobs
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling with a learning effect
- Due-date assignment and single machine scheduling with deteriorating jobs
- Note on scheduling with general learning curves to minimize the number of tardy jobs
- Λ-Shaped Policies to Schedule Deteriorating Jobs
- A note on scheduling problems with learning effect and deteriorating jobs
- Single Machine Scheduling with Flow Allowances
- Scheduling problems with a learning effect
This page was built for publication: Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine
