A new heuristic algorithm for the machine scheduling problem with job delivery coordination

Theoretical Computer Science

Volumn 410, Issue 27-29, 2009, Pages 2581-2591

  Su, Chi Shiang ^a   Pan, Jason Chao Hsien ^b   Hsu, Tsung Shin ^a  

^a NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

^b TAKMING UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Complexity theory; Heuristic; Scheduling; Supply chain management

Indexed keywords

CHANGING ENVIRONMENTS; COMPETITIVE ADVANTAGES; COMPLEXITY THEORY; HEURISTIC; MACHINE SCHEDULING PROBLEMS; MAKESPAN; NP-HARD PROBLEMS; PARALLEL MACHINES; PRODUCTION STAGES; SCHEDULING MODELS; SUPPLY CHAIN SYSTEMS; TWO STAGES;

CHAINS; COMPETITION; COMPUTATIONAL COMPLEXITY; HEURISTIC ALGORITHMS; HEURISTIC METHODS; MACHINERY; PORTALS; SUPPLY CHAINS;

SUPPLY CHAIN MANAGEMENT;

EID: 65549123761     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.02.019     Document Type: Article

References (15)

1. Chang Y.C., and Lee Y.L. Machine scheduling with job delivery coordination. European Journal of Operational Research 158 (2004) 470-487
2. Cheng T.C.E., Gordon V.S., and Kovalyov M.Y. Single machine scheduling with batch deliveries. European Journal of Operational Research 94 (1996) 277-283
3. He Y., Zhong W., and Gu H. Improved algorithms for two single machine scheduling problems. Theoretical Computer Science 363 (2006) 257-265
4. Kellerer H., and Pferschy U. A new fully polynomial approximation scheme for the knapsack problem. Lecture Notes in Computer Science 1444 (1998) 123-134
5. Lawler E. Fast approximation algorithms for knapsack problems. Mathematics of Operations Research 4 (1979) 339-356
6. Lee C.Y., and Chen Z.L. Machine scheduling with transportation considerations. Journal of Scheduling 4 (2001) 3-24
7. Li C.L., Vairaktarakis G., and Lee C.Y. Machine scheduling with deliveries to multiple customer locations. European Journal of Operational Research 164 (2005) 39-51
8. Pinedo M. Scheduling: Theory, Algorithms, and Systems (1995), Prentice-Hall, Englewoods Cliffs, NJ
9. Potts C.N., and Kovalyov M.Y. Scheduling with batching: A review. European Journal of Operational Research 120 (2000) 228-249
10. Potts C.N., and Van W.L.N. Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity. Journal of the Operational Research Society 43 (1992) 395-406
11. Simchi-Levi D. New worst-case results for the bin packing problem. Naval Research Logistics 41 (1994) 579-585
12. Soukhal A., Oulamara A., and Martineau P. Complexity of flow shop scheduling problems with transportation constraints. European Journal of Operational Research 161 (2005) 32-41
13. Woeginger G.J. Heuristics for parallel machine scheduling with delivery times. Acta Informatica 31 (1994) 503-512
14. Yue M. A simple proof of the inequality F F D (L) ≤ 11 O P T (L) / 9 + 1 ∀ L, for the FFD bin-packing algorithm. Acta Mathematica Applicate Sinica 7 (1991) 321-331
15. Zhong W., Do'sa G., and Tan Z. On the machine scheduling problem with job delivery coordination. European Journal of Operational Research 182 (2007) 1057-1072