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.003zbMATH Open1156.90360OpenAlexW2011091256MaRDI QIDQ1008577FDOQ1008577
Authors: Tamer Eren
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
Recommendations
- Comments on ``A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect
- Minimizing the maximum lateness in a single-machine scheduling problem with the normal time-dependent and job-dependent learning effect
- Minimizing total tardiness in a scheduling problem with a learning effect
- Minimizing the total completion time in a single-machine scheduling problem with a learning effect
- Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
- A revision of machine scheduling problems with a general learning effect
- Notes on ``Some single-machine scheduling problems with general position-dependent and time-dependent learning effects
- Scheduling with learning effects and/or time-dependent processing times to minimize the weighted number of tardy jobs on a single machine
- Machine scheduling problems with a general learning effect
- A note on ``Single-machine scheduling problems with both deteriorating jobs and learning effects
Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35)
Cites Work
- A bicriteria parallel machine scheduling with a learning effect of setup and removal times
- Single-machine scheduling with learning considerations
- Scheduling with general job-dependent learning curves.
- Parallel machine scheduling with a learning effect
- Single machine scheduling with learning effect considerations
- Scheduling problems with a learning effect
- Flow-shop scheduling with a learning effect
- Single-machine and two-machine flowshop scheduling with general learning functions
- A bicriteria flowshop scheduling with a learning effect
- A bi-criterion single-machine scheduling problem with learning considerations
- Minimizing total tardiness in a scheduling problem with a learning effect
- A Bicriteria Scheduling Problem with a Learning Effect: Total Completion Time and Total Tardiness
- A bi-criteria two-machine flowshop scheduling problem with a learning effect
- A note on flow shop scheduling problems with a learning effect on no-idle dominant machines
Cited In (18)
- Bicriterion optimization for flow shop with a learning effect subject to release dates
- Parallel machines scheduling with machine preference via agent-based approach
- Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times
- Scheduling on parallel processors with varying processing times
- 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
- Single-machine group scheduling with general deterioration and learning effects
- Minimizing total tardiness in a scheduling problem with a learning effect
- Scheduling identical jobs on uniform parallel machines under position-based learning effects
- Fast LP models and algorithms for identical jobs on uniform parallel machines
- A bicriteria parallel machine scheduling with a learning effect of setup and removal 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
- Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations
- A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization
- Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect
- A job scheduling and rejection problem considering self-contained and cross-functional jobs
- Single machine scheduling with a general exponential learning effect
This page was built for publication: A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1008577)