Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness
- 1 April 2017
- journal article
- research article
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 64 (3) , 249-267
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation (71125003, 71421002, 71520107003)
This publication has 26 references indexed in Scilit:
- Multiple subset sum with inclusive assignment set restrictionsNaval Research Logistics (NRL), 2011
- Fast approximation algorithms for job scheduling with processing set restrictionsTheoretical Computer Science, 2010
- Robust scaling parameters for composite dispatching rulesIIE Transactions, 2010
- Scheduling parallel machines with inclusive processing set restrictionsNaval Research Logistics (NRL), 2008
- Parallel machine scheduling with job assignment restrictionsNaval Research Logistics (NRL), 2006
- Parallel machine scheduling under a grade of service provisionComputers & Operations Research, 2004
- Unrelated parallel machine scheduling with job splittingIIE Transactions, 2004
- Uniform Design: Theory and ApplicationTechnometrics, 2000
- Scheduling jobs on parallel machines with sequence-dependent setup timesEuropean Journal of Operational Research, 1997
- A heuristic to minimize the total weighted tardiness with sequence-dependent setupsIIE Transactions, 1997