Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect

DOI10.1016/j.amc.2008.12.001zbMath1155.90380OpenAlexW2091902132MaRDI QIDQ1004418

Tamer Eren

Publication date: 10 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.001

zbMATH Keywords

single machine schedulinglearning effectweighted completion timenon-linear mathematical programming modelunequal release dates

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (17)

Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations ⋮ A SINGLE-MACHINE TWO-AGENT SCHEDULING PROBLEM BY GA APPROACH ⋮ Two-agent singe-machine scheduling with release times to minimize the total weighted completion time ⋮ Note on a single-machine scheduling problem with sum of processing times based learning and ready times ⋮ Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity ⋮ Predictive-reactive strategy for identical parallel machine rescheduling ⋮ Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times ⋮ Single machine scheduling with a general exponential learning effect ⋮ A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs ⋮ Single-machine group scheduling with general deterioration and learning effects ⋮ A genetic algorithm-based approach for single-machine scheduling with learning effect and release time ⋮ Approximation algorithms for some position-dependent scheduling problems ⋮ A note on single-machine scheduling with general learning effect and past-sequence-dependent setup time ⋮ Single-machine scheduling with two competing agents and learning consideration ⋮ A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function ⋮ Genetic Algorithm for a Two-Agent Scheduling Problem with Truncated Learning Consideration ⋮ An EPL model with reliability-dependent randomly imperfect production system over different uncertain finite time horizons

Cites Work

• Unnamed Item
• A note on flow shop scheduling problems with a learning effect on no-idle dominant machines
• A bicriteria flowshop scheduling with a learning effect
• A note on minimizing maximum lateness in an \(m\)-machine scheduling problem 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
• Common due date scheduling with autonomous and induced learning
• Minimizing total tardiness in a scheduling problem with a learning effect
• Parallel machine scheduling with a learning effect
• Note on scheduling with general learning curves to minimize the number of tardy jobs
• 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: Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect