Bi-criteria single machine scheduling problem with a learning effect: Aneja-Nair method to obtain the set of optimal sequences
From MaRDI portal
Publication:980085
DOI10.1016/j.camwa.2009.01.042zbMath1189.90062OpenAlexW2028339362MaRDI QIDQ980085
Publication date: 28 June 2010
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2009.01.042
Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35)
Related Items (1)
Cites Work
- Single-machine and two-machine flowshop scheduling with general learning functions
- Single-machine scheduling problems with a learning effect
- Minimizing the makespan in a single machine scheduling problem with a time-based learning effect
- Single-machine scheduling with learning considerations
- A bi-criterion single-machine scheduling problem with learning considerations
- Common due date scheduling with autonomous and induced learning
- The learning effect: getting to the core of the problem
- A state-of-the-art review on scheduling with learning effects
- A new approach to the learning effect: Beyond the learning curve restrictions
- Flow-shop scheduling with a learning effect
- Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
- Bicriteria Transportation Problem
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- On the Minimization of Completion Time Variance with a Bicriteria Extension
- Parallel machine scheduling with a learning effect
- Scheduling jobs with position-dependent processing times
- Note on scheduling with general learning curves to minimize the number of tardy jobs
- Scheduling problems with a learning effect
This page was built for publication: Bi-criteria single machine scheduling problem with a learning effect: Aneja-Nair method to obtain the set of optimal sequences
