Minimizing number of tardy jobs on a batch processing machine with incompatible job families

European Journal of Operational Research

Volumn 162, Issue 1, 2005, Pages 184-190

  Jolai, Fariborz ^a  

^a UNIVERSITY OF TEHRAN   (Iran)

Author keywords

Batch processing machine; Dynamic programming; Number of tardy jobs criteria; Scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; JOB ANALYSIS; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING;

BATCH PROCESSING MACHINES; NUMBER OF TARDY JOBS CRITERIA; TIME COMPLEXITY;

OPERATIONS RESEARCH;

EID: 8344253664     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2003.10.011     Document Type: Conference Paper

References (27)

1. Ahmadi J.H., Ahmadi R.H., Dasu S., Tang C.S. Batching and scheduling jobs on batch and discrete processors. Operations Research. 40:1992;750-763.
2. Azizoglu M., Webster S. Scheduling a batch processing machine with incompatible job families. Computers & Industrial Engineering. 39:2001;325-335.
3. Brucker P., Gladky A., Hoogeveen H., Kovalyov M.Y., Potts C., Tautenhahn T., Van de velde S. Scheduling a batching machine. Journal of Scheduling. 1:1998;31-45.
4. Brucker P. Theory of Scheduling. 1995;Springer, Berlin.
5. Chandru V., Lee C.Y., Uzsoy R. Minimizing total completion time on batch processing machines. International Journal of Production Research. 31:1993;2097-2121.
6. Chandru V., Lee C.Y., Uzsoy R. Minimizing total completion time on a batch processing machine with job families. Operations Research Letters. 13:1993;61-65.
7. G. Dobson, R.S. Nambinadom, The batch loading and scheduling problem, Research Report, Simon School of Business Administration, University of Rochester, Rochester, NY, 1992.
8. Dupont L., Jolai Ghazvini F. Branch and bound method for minimizing mean flow time on a single batch processing machine. International Journal of Industrial Engineering. 4:1997;197-203.
9. L. Dupont, F. Jolai Ghazvini, An efficient heuristic for minimizing mean flow time on a single batch processing machine, in: Proceeding of the International Franco-Quebec Conference on Industrial Engineering, Albi, France, 1997.
10. Dupont L., Jolai Ghazvini F. Minimizing makespan on a single batch processing machine with non identical job sizes. European Journal of Automation Systems. 32:1998;431-440.
11. Hochbaum D.S., Landy D. Scheduling semiconductor burn-in operations to minimize total flow time. Operations Research. 45:1997;874-885.
12. Ikura Y., Gimple M. Efficient scheduling algorithms for a single batch processing machine. Operations Research Letters. 5:1986;61-65.
13. F. Jolai Ghazvini, Ordonnancement sous contrainte de groupage, Unpublished Ph.D. dissertation, Institut National Polytechnique de Grenoble, France, 1998.
14. Jolai Ghazvini F., Dupont L. Minimizing mean flow time on a single batch processing machine with non identical job sizes. International Journal of Production Economic. 55:1998;273-280.
15. Karp R.M. Miller R.E., Thatcher J.W. Reducibility Among Combinatorial Problems in Complexity of Computation. 1972;85-103 Plenum press, New York.
16. K.G. Kempf, R. Uzsoy, C.-S. Wang, Scheduling a single batch processing machine with secondary resource constraints, Research Memorandum No. 96-13, Department of Industrial Engineering, Purdue University, USA, 1996.
17. Lee C.Y., Uzsoy R., Martin-Vega L.A. Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research. 40:1992;764-775.
18. Lee C.Y., Uzsoy R. Minimizing makespan on a single batch processing machine with dynamic job arrivals. International Journal of Production Research. 37:1998;219-236.
19. Li C.L., Lee C.Y. Scheduling with agreeable release times and due dates on a batch processing machine. European Journal of Operations Research. 96:1997;564-569.
20. Mehta S.V., Uzsoy R. Minimizing total tardiness on a batch processing machine with incompatible job families. IIE Transactions on Scheduling and Logistics. 30:1998;165-178.
21. Moore J.M. An. n job one machine sequencing algorithm for minimizing the number of late jobs Management Science. 15:1968;102-109.
22. Neale J.J., Duenyas I. Control of manufacturing networks which contain a batch processing machine. IIE Transaction on Scheduling and Logistics. 32:2000;1027-1041.
23. Rinnoy kan A.H.G. Machine Scheduling Problems; Classification Complexity and Computation. 1976;Nijhoff, The Hague.
24. Runyan W.R., Bean K.E. Semiconductor Integrated Circuit Processing Technology. 1990;Addison-Wesley, New York.
25. Uzsoy R. A single batch processing machine with non-identical job sizes. International Journal of Production Research. 32:1994;1615-1635.
26. Uzsoy R. Scheduling batch processing machines with incompatible job families. International Journal of Production Research. 33:1995;2685-2708.
27. Uzsoy R., Yang Y. Minimizing total weighted completion time on a single batch processing machine. Journal of Production and Operations Management. 6:1997;57-73.