Parallel-machine batch scheduling to minimize the maximum lateness and the number of tardy jobs

International Journal of Production Economics

Volumn 91, Issue 2, 2004, Pages 121-134

  Lin, B M T ^a   Jeng, A A K ^a  

^a NATIONAL CHI NAN UNIVERSITY   (Taiwan)

Author keywords

Batch scheduling; Due date; Dynamic program; Heuristics; Maximum lateness; Number of tardy jobs; Parallel machine

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; HEURISTIC PROGRAMMING; INDUSTRIAL ECONOMICS; OPTIMIZATION; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; PROCESSING;

BATCH SCHEDULING; DUE DATE; DYNAMIC PROGRAMMING (DP); HEURISTIC; MAXIMUM LATENESS; NUMBER OF TARDY JOBS; PARALLEL MACHINES;

SCHEDULING;

EID: 4043173298     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2003.07.003     Document Type: Article

References (19)

1. Albers S., Brucker P. The complexity of one-machine batching problems. Discrete Applied Mathematics. 47(11):1993;87-107.
2. Brucker P., Kovalyov M.K. Single machine batch scheduling to minimize the weighted number of late jobs. Mathematical Methods of Operations Research. 43:1996;1-8.
3. Cheng T.C.E., Kovalyov M.Y. Parallel machine batching and scheduling with deadlines. Journal of Scheduling. 3(2):2000;109-123.
4. Cheng T.C.E., Chen Z.L., Kovalyov M.Y., Lin B.M.T. Parallel-machine batching and scheduling to minimize total completion time. IIE Transactions. 28(11):1996;953-956.
5. Cheng T.C.E., Gupta J.N.D., Wang G. A review of flowshop scheduling research with setup times. Production and Operations Management. 9(3):2000;262-283.
6. Coffman E.G., Yannakakis M., Magazine M.J., Santos C. Batch sizing and sequencing on a single machine. Annals of Operations Research. 26:1989;135-147.
7. Dobson G., Karmarkar U.S., Rummel J.L. Batching to minimize flow times on one machine. Management Science. 33(6):1987;784-799.
8. Ho J.C., Chang Y.L. Minimizing the number of tardy jobs for. m parallel machines European Journal of Operational Research. 84(7):1995;343-355.
9. Hochbaum D.S., Landy D. Scheduling with batching. Minimizing the weighted number of tardy jobs Operations Research Letters. 16:1994;79-86.
10. Jackson, J.R., 1955. Scheduling a production line to minimize maximum tardiness. Research Report 43, Management Science Research Project, UCLA.
11. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B., 1993. Sequencing and scheduling: Algorithms and complexity. In: Graves, S.G., Rinnooy Kan, A.H.G., Zipkin, P.H. (Eds.), Logistics of Production and Inventory, North-Holland, Amsterdam, pp. 445-522.
12. Moore J.M. An. n job one machine sequencing algorithm for minimizing the number of tardy jobs Management Science. 15:1968;102-109.
13. Naddef D., Santos C. On-pass batching algorithms for one machine problem. Discrete Applied Mathematics. 21:1988;133-145.
14. Pan J.C.H., Wu C.C. Single machine group scheduling with bi-criteria and due date constraints. Production Planning and Control. 9(4):1998;365-370.
15. Pinedo M. Scheduling, Theory, Algorithm and Systems. 1995;Prentice-Hall, Englewood Cliffs, NJ.
16. Potts C.N., Kovalyov M.K. Scheduling with batching. A review European Journal of Operational Research. 120(2):2000;228-249.
17. Wang G., Cheng T.C.E. Parallel machine scheduling with batch delivery costs. International Journal of Production Economics. 68(2):2000;177-183.
18. Webster S.T., Baker K.R. Scheduling groups of jobs on a single machine. Operations Research. 43:1995;692-703.
19. Weng M.X., Lu J., Ren H. Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective. International Journal of Production Economics. 70(3):2001;215-226.