A fast neighborhood search scheme for identical parallel machine scheduling problems under general learning curves
Author:
- Radosław RudekRRRadosław Rudek
- 1 December 2021
- journal article
- research article
- Published by Elsevier in Applied Soft Computing
- Vol. 113
Abstract
No abstract availableKeywords
Funding Information
- Narodowe Centrum Nauki (DEC-2016/21/B/HS4/00667)
This publication has 58 references indexed in Scilit:
- Scheduling problems with position dependent job processing times: computational complexity resultsAnnals of Operations Research, 2012
- Single-machine scheduling with general sum-of-processing-time-based and position-based learning effectsOmega, 2011
- Computational complexity and solution algorithms for flowshop scheduling problems with the learning effectComputers & Industrial Engineering, 2011
- The single-machine total weighted tardiness scheduling problem with position-based learning effectsComputers & Operations Research, 2011
- Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effectsAnnals of Operations Research, 2011
- Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effectApplied Mathematical Modelling, 2010
- Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerationsInformation Sciences, 2009
- Parallel machine scheduling with a learning effectJournal of the Operational Research Society, 2001
- Optimization by Simulated AnnealingScience, 1983
- A heuristic algorithm for the m-machine, n-job flow-shop sequencing problemOmega, 1983