Minimizing tardy jobs in a flowshop with common due date

European Journal of Operational Research

Volumn 120, Issue 2, 2000, Pages 375-381

  Della Croce, Federico ^a   Gupta, Jatinder N D ^b   Tadei, Roberto ^a  

^a POLITECNICO DI TORINO   (Italy)

^b Ball State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; JUST IN TIME PRODUCTION; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PRODUCTION CONTROL;

BRANCH AND BOUND PROCEDURE; FLOWSHOP SCHEDULING; JOB SELECTION; KNAPSACK PROBLEM; TARDY JOBS;

SCHEDULING;

EID: 0033907095     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00164-2     Document Type: Article

References (13)

1. F. Della Croce, J.N.D. Gupta, D. Maio, R. Tadei, Minimizing the number of tardy jobs on a two-machine flow-shop with common due date, Internal Report, D.A.I. Politecnico di Torino, Italy, 1997.
2. Gupta J.N.D. M-stage scheduling problem: A critical appraisal. International Journal of Production Research. 9:1971;267-281.
3. J.N.D. Gupta, Scheduling research paradigms: Review and Extensions, in: Production as a Mean of Improving Productivity, Proceedings of the Seventh International Conference at Windsor, Canada, 1984, pp. 377-383.
4. J.N.D. Gupta, A.M.A. Hariri, Integrating job selection and scheduling in a flowshop, Working paper, Department of Management, Ball State University, Muncie, IN, 1994.
5. Gupta J.N.D., Hariri A.M.A. Two machine flow-shop to minimize number of tardy jobs. Journal of the Operational Research Society. 48:1997;212-220.
6. Hariri A.M.A., Potts C.N. A branch and bound algorithm to minimize number of late jobs in a permutation flow-shop. European Journal of Operational Research. 38:1989;228-237.
7. Ho J.C., Gupta J.N.D. Flowshop scheduling with dominant machines. Computers and Operations Research. 22:1995;237-246.
8. Johnson S.M. Optimal two and three stage production schedules with setup times included. Naval Research Logistics Quarterly. 1:1954;61-68.
9. Jozefowska J., Jurisch B., Kubiak W. Scheduling shops to minimize the weighted number of late jobs. Operations Research Letters. 10:1994;27-33.
10. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, Sequencing and scheduling: Algorithms and complexity, in: S.C. Graves et al. (Eds.), Handbook of Operations Research, vol. 4, Elsevier, Amsterdam, 1993, pp. 445-552.
11. Lawler E.L., Moore J.M. A functional equation and its application to resource allocation and sequencing problems. Management Science. 16:1969;77-84.
12. Moore J.M. An. n -job, one-machine sequencing algorithm for minimizing the number of late jobs Management Science. 15:1968;102-109.
13. Smith M.L., Panwalker S.S., Dudek R.A. Flowshop sequencing with ordered processing times matrices. Management Science. 21:1975;544-551.