Flowshop scheduling problems with a position-dependent exponential learning effect
Summary: We consider a permutation flowshop scheduling problem with a position-dependent exponential learning effect. The objective is to minimize the performance criteria of makespan and the total flow time. For the two-machine flow shop scheduling case, we show that Johnson's rule is not an optimal algorithm for minimizing the makespan given the exponential learning effect. Furthermore, by using the shortest total processing times first (STPT) rule, we construct the worst-case performance ratios for both criteria. Finally, a polynomial-time algorithm is proposed for special cases of the studied problem.
- Flowshop scheduling with a general exponential learning effect
- Flow-shop scheduling with a learning effect
- Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects
- Single machine scheduling with a general exponential learning effect
- Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect
- A new approach to the learning effect: Beyond the learning curve restrictions
- A note on single-machine scheduling with job-dependent learning effects
- A state-of-the-art review on scheduling with learning effects
- An Evaluation of Flow Shop Sequencing Heuristics
- Flow shop scheduling jobs with position-dependent processing times
- Flow-shop scheduling with a learning effect
- Flow-shops with a dominant machine
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Flowshop scheduling with dominant machines
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Machine scheduling problems with a general learning effect
- Minimizing total absolute deviation of job completion times: extensions to position-dependent processing times and parallel identical machines
- Nonpreemptive flowshop scheduling with machine dominance
- Optimal two- and three-stage production schedules with set-up time included
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling
- Scheduling jobs with position-dependent processing times
- Scheduling problems with a learning effect
- Scheduling with general job-dependent learning curves.
- Single machine scheduling with learning effect considerations
- Single-machine and two-machine flowshop scheduling with general learning functions
- Single-machine group scheduling with time-dependent learning effect and position-based setup time learning effect
- Single-machine scheduling problems with actual time-dependent and job-dependent learning effect
- Single-machine scheduling with learning considerations
- Solving a two-agent single-machine scheduling problem considering learning effect
- Some results of the worst-case analysis for flow shop scheduling
- Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations
- Flow shop scheduling jobs with position-dependent processing times
- Research on permutation flow shop scheduling problems with general position-dependent learning effects
- A makespan study of the two-machine flowshop scheduling problem with a learning effect
- Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms
- Flowshop scheduling with a general exponential learning effect
- Flow-shop scheduling with a learning effect
- Flow shop scheduling problem with non-linear learning effects: a linear approximation scheme for non-technical users
- Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects
This page was built for publication: Flowshop scheduling problems with a position-dependent exponential learning effect
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q474618)
