Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations
From MaRDI portal
Publication:845319
DOI10.1016/j.ins.2009.07.011zbMath1179.90141OpenAlexW2012079986MaRDI QIDQ845319
Publication date: 28 January 2010
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2009.07.011
Related Items (39)
Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects ⋮ Scheduling deteriorating jobs with a learning effect on unrelated parallel machines ⋮ Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms ⋮ Several flow shop scheduling problems with truncated position-based learning effect ⋮ Flowshop scheduling with a general exponential learning effect ⋮ Single-machine scheduling with learning and forgetting effects ⋮ Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times ⋮ Single machine past-sequence-dependent delivery times scheduling with general position-dependent and time-dependent learning effects ⋮ Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration ⋮ Single machine scheduling with general time-dependent deterioration, position-dependent learning and past-sequence-dependent setup times ⋮ Scheduling jobs with truncated exponential learning functions ⋮ 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 ⋮ The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times ⋮ Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time ⋮ Single-machine group scheduling with general deterioration and learning effects ⋮ Single-machine scheduling problems with time and position dependent processing times ⋮ A revision of some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations ⋮ A note on machine scheduling with sum-of-logarithm-processing-time-based and position-based learning effects ⋮ A genetic algorithm-based approach for single-machine scheduling with learning effect and release time ⋮ Minimizing the makespan for scheduling problems with general deterioration effects ⋮ Single machine scheduling with sum-of-logarithm-processing-times based and position based learning effects ⋮ Single machine scheduling with exponential learning functions ⋮ Research on permutation flow shop scheduling problems with general position-dependent learning effects ⋮ Flowshop scheduling problems with a position-dependent exponential learning effect ⋮ Single-machine scheduling with two competing agents and learning consideration ⋮ Some single-machine scheduling problems with elapsed-time-based and position-based learning and forgetting effects ⋮ Single-machine scheduling with learning effects and maintenance: a methodological note on some polynomial-time solvable cases ⋮ Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects ⋮ Machine scheduling problems with a position-dependent deterioration ⋮ Erratum to `Some single-machine and m-machine flowshop scheduling problems with learning considerations' ⋮ The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model ⋮ Machine scheduling problems with a general learning effect ⋮ Note on ``Single-machine and flowshop scheduling with a general learning effect model and ``Some single-machine and m-machine flowshop scheduling problems with learning considerations ⋮ A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times ⋮ Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects ⋮ A study of decision process in MCDM problems with large number of criteria ⋮ Single machine and flowshop scheduling problems with sum-of-processing time based learning phenomenon ⋮ A Note on Scheduling Jobs with Extended Sum-of-Processing-Times-Based and Position-Based Learning Effect
Cites Work
- Unnamed Item
- Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations
- Single-machine and two-machine flowshop scheduling with general learning functions
- Real-time preemptive scheduling of sporadic tasks based on supervisory control of discrete event systems
- A note on the total completion time problem in a permutation flowshop with a learning effect
- Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect
- A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect
- Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
- Single-machine scheduling with learning considerations
- A bi-criterion single-machine scheduling problem with learning considerations
- A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness
- Minimizing total tardiness in a scheduling problem with a learning effect
- A state-of-the-art review on scheduling with learning effects
- A new approach to the learning effect: Beyond the learning curve restrictions
- Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
- A bi-criteria two-machine flowshop scheduling problem with a learning effect
- Flow-shop scheduling with a learning effect
- Parallel machine scheduling with a learning effect
- Complexity results for single-machine scheduling with positional learning effects
- Scheduling problems with a learning effect
This page was built for publication: Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations
