Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time
Authors:
- Youjun ChenYCYoujun Chen
- Lingfa LuLLLingfa Lu
- Jinjiang YuanJYJinjiang Yuan
Open Access
- 1 April 2016
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 622, 45-65
Abstract
No abstract availableKeywords
Funding Information
- NSFC (11271338)
- NSFC (11301528)
- NSFC (11426094)
- NSF-Henan (15IRTSTHN006)
This publication has 20 references indexed in Scilit:
- Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion timeTheoretical Computer Science, 2015
- Approximation algorithms for two-machine open shop scheduling with batch and delivery coordinationTheoretical Computer Science, 2013
- SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPANAsia-Pacific Journal of Operational Research, 2008
- Improved algorithms for two single machine scheduling problemsTheoretical Computer Science, 2006
- Machine scheduling with job delivery coordinationEuropean Journal of Operational Research, 2004
- Machine scheduling with transportation considerationsJournal of Scheduling, 2001
- Approximation schemes for minimizing average weighted completion time with release dates1999
- Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic BetterMathematics of Operations Research, 1992
- Scheduling Problems With Generalized Due DatesIIE Transactions, 1986
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979