A note on minimizing maximum lateness in an m-machine scheduling problem with a learning effect

DOI10.1016/J.AMC.2008.12.003MaRDI QIDQ1008577zbMATHOpenAlexFDO

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

zbMATH Keywords

maximum latenessparallel machine schedulinglearning effectmathematical programming model

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35)

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

Cites work

• 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 bi-criterion single-machine scheduling problem with learning considerations
• A bicriteria flowshop scheduling with a learning effect
• A bicriteria parallel machine scheduling with a learning effect of setup and removal times
• A note on flow shop scheduling problems with a learning effect on no-idle dominant machines
• Flow-shop scheduling with a learning effect
• Minimizing total tardiness in a scheduling problem with a learning effect
• Parallel machine scheduling with a learning effect
• 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 scheduling with learning considerations

Cited in

(19)

• Scheduling identical jobs on uniform parallel machines under position-based learning effects
• Parallel machines scheduling with machine preference via agent-based approach
• A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization
• A job scheduling and rejection problem considering self-contained and cross-functional jobs
• 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
• Bicriterion optimization for flow shop with a learning effect subject to release dates
• Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect
• Single-machine group scheduling with general deterioration and learning effects
• A bicriteria parallel machine scheduling with a learning effect of setup and removal times
• Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations
• Near-optimal solutions and tight lower bounds for the parallel machines scheduling problem with learning effect
• Scheduling on parallel processors with varying processing times
• Fast LP models and algorithms for identical jobs on uniform parallel machines
• Parallel machine scheduling with general sum of processing time based models
• Single machine scheduling with a general exponential learning effect
• Single-machine due-window assignment and scheduling with learning effect and resource-dependent processing times
• Minimizing total tardiness in a scheduling problem with a learning effect
• Note on a single-machine scheduling problem with sum of processing times based learning and ready times

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)