A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect
From MaRDI portal
Publication:1008577
DOI10.1016/J.AMC.2008.12.003zbMath1156.90360OpenAlexW2011091256MaRDI QIDQ1008577
Publication date: 30 March 2009
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2008.12.003
Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35)
Related Items (15)
Parallel machines scheduling with machine preference via agent-based approach ⋮ Scheduling identical jobs on uniform parallel machines under position-based learning effects ⋮ Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations ⋮ Scheduling on parallel processors with varying processing times ⋮ Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times ⋮ Note on a single-machine scheduling problem with sum of processing times based learning and ready times ⋮ Parallel machine scheduling with general sum of processing time based models ⋮ A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization ⋮ Single machine scheduling with a general exponential learning effect ⋮ Single-machine group scheduling with general deterioration and learning effects ⋮ Bicriterion optimization for flow shop with a learning effect subject to release dates ⋮ A simulated annealing approach to minimize the maximum lateness on uniform parallel machines ⋮ Comments on ``A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect ⋮ Fast LP models and algorithms for identical jobs on uniform parallel machines ⋮ Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect
Cites Work
- A bicriteria parallel machine scheduling with a learning effect of setup and removal times
- Single-machine and two-machine flowshop scheduling with general learning functions
- A note on flow shop scheduling problems with a learning effect on no-idle dominant machines
- A bicriteria flowshop scheduling with a learning effect
- Single-machine scheduling with learning considerations
- Scheduling with general job-dependent learning curves.
- A bi-criterion single-machine scheduling problem with learning considerations
- Minimizing total tardiness in a scheduling problem with a 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
- Single machine scheduling with learning effect considerations
- Scheduling problems with a learning effect
- A Bicriteria Scheduling Problem with a Learning Effect: Total Completion Time and Total Tardiness
This page was built for publication: A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect
