Variable neighbourhood search for parallel machine scheduling with a single loading server: a truck-scheduling perspective
Open Access
- 5 June 2024
- journal article
- research article
- Published by Taylor & Francis in Supply Chain Forum: An International Journal
- Vol. 25 (3) , 308-320
Abstract
No abstract availableKeywords
Funding Information
- Canadian Natural Sciences and Engineering Research Council (2020-00401)
This publication has 44 references indexed in Scilit:
- A machine learning approach for flow shop scheduling problems with alternative resources, sequence-dependent setup times, and blockingOR Spectrum, 2019
- Solving parallel machine problems with delivery times and tardiness objectivesAnnals of Operations Research, 2019
- Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisionsAnnals of Operations Research, 2017
- Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup timeAnnals of Operations Research, 2017
- Tabu Search Approaches for Two Car Sequencing Problems with Smoothing Constraints2016
- Metaheuristics for a job scheduling problem with smoothing costs relevant for the car industryNetworks, 2015
- Mixed integer programming formulations for the Biomass Truck Scheduling problemCentral European Journal of Operations Research, 2015
- Truck scheduling in cross-docking terminals with fixed outbound departuresOR Spectrum, 2012
- A variable neighborhood search heuristic for the design of multicommodity production–distribution networks with alternative facility configurationsOR Spectrum, 2009
- Complexity results for parallel machine problems with a single serverJournal of Scheduling, 2002