An exact framework for the discrete parallel machine scheduling location problem
- 19 April 2021
- journal article
- research article
- Published by Elsevier in Computers & Operations Research
- Vol. 132, 105318
Abstract
No abstract availableKeywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Bin packing and cutting stock problems: Mathematical models and exact algorithmsEuropean Journal of Operational Research, 2016
- Scheduling of unrelated parallel machines with limited server availability on multiple production locations: a case study in knitted fabricsInternational Journal of Production Research, 2013
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windowsComputers & Operations Research, 2013
- Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial modelEuropean Journal of Operational Research, 2011
- Solving scheduling and location problems in the plane simultaneouslyComputers & Operations Research, 2010
- Simultaneous scheduling and location (ScheLoc): the planar ScheLoc makespan problemJournal of Scheduling, 2008
- LP models for bin packing and cutting stock problemsEuropean Journal of Operational Research, 2002
- A gamma heuristic for the p-median problemEuropean Journal of Operational Research, 1999
- A time indexed formulation of non-preemptive single machine scheduling problemsMathematical Programming, 1992
- Optimal Sequencing of a Single Machine Subject to Precedence ConstraintsManagement Science, 1973