Scheduling algorithms to minimise the total family flow time for job shops with job families

References

• Adam , N , Bertrand , J and Surkis , J . 1987 . Priority assignment procedures in multi-level assembly job shops . IIE Transactions , 19 ( 3 ) : 317 – 328 .
   Web of Science ®Google Scholar
• Adams , J , Balas , E and Zawack , D . 1988 . The shifting bottleneck procedure for job shop scheduling . Management Science , 34 ( 3 ) : 391 – 401 .
   Web of Science ®Google Scholar
• Baker , K . 1974 . Introduction to sequencing and scheduling , New York : John Wiley & Sons .
   Google Scholar
• Blum , C and Sampels , M . 2004 . An ant colony optimization algorithm for shop scheduling problems . Journal of Mathematical Modelling and Algorithms , 3 ( 3 ) : 285 – 308 .
   Google Scholar
• Doctor , S , Cavalier , T and Egbelu , P . 1993 . Scheduling for machining and assembly in a job-shop environment . International Journal of Production Research , 31 ( 6 ) : 1275 – 1297 .
   Web of Science ®Google Scholar
• Dorigo , M and Di Caro , G . 1999 . The ant colony optimization meta-heuristic: new ideas in optimization , Maidenhead, , UK : McGraw-Hill .
   Google Scholar
• Glover , F . 1990 . Tabu search – part II . ORSA Journal on computing , 2 ( 1 ) : 4 – 32 .
   Google Scholar
• Guide , VDR . 1995 . A simulation model of drum-buffer-rope for production planning and control at a naval aviation depot . Simulation , 65 ( 3 ) : 157 – 168 .
   Google Scholar
• Guide , VDR . 1996 . Scheduling using drum-buffer-rope in a remanufacturing environment . International Journal of Production Research , 34 ( 4 ) : 1081 – 1091 .
   Web of Science ®Google Scholar
• Guide , VDR , Kraus , ME and Srivastava , R . 1997 . Scheduling policies for remanufacturing . International Journal of Production Economics , 48 ( 2 ) : 187 – 204 .
   Web of Science ®Google Scholar
• Guide , VDR . 2000 . Production planning and control for remanufacturing: industry practice and research needs . Journal of Operations Management , 18 ( 4 ) : 467 – 483 .
   Web of Science ®Google Scholar
• Guide , VDR , Srivastava , R and Kraus , M . 2000 . Priority scheduling policies for repair shops . International Journal of Production Research , 38 ( 4 ) : 929 – 950 .
   Web of Science ®Google Scholar
• Huang , K and Liao , C . 2008 . Ant colony optimization combined with taboo search for the job shop scheduling problem . Computers and Operations Research , 35 ( 4 ) : 1030 – 1046 .
   Web of Science ®Google Scholar
• Jain , A and Meeran , S . 1999 . Deterministic job-shop scheduling: past, present and future . European Journal of Operational Research , 113 ( 2 ) : 390 – 434 .
   Web of Science ®Google Scholar
• Kirkpatrick , S , Gelatt , CD and Vecchi , MP . 1983 . Optimization by simulated annealing . Science , 220 ( 4598 ) : 671 – 680 .
   PubMed Web of Science ®Google Scholar
• Lenstra , J , Kan , A and Brucker , P . 1977 . Complexity of machine scheduling problems . Annals of Discrete Mathematics , 1 : 343 – 362 .
   Google Scholar
• Lund , R . 1984 . Remanufacturing . Technology Review , 87 ( 2 ) : 18 – 23 .
   Web of Science ®Google Scholar
• Maxwell , W and Mehra , M . 1968 . Multiple-factor rules for sequencing with assembly constraints . Naval Research Logistics Quarterly , 15 ( 2 ) : 241 – 254 .
   Google Scholar
• Maxwell, W.L., 1969. Priority dispatching and assembly operations in a job shop. Memorandum RM-5370-PR prepared for the US Air Force under project RAND - contract no. F44620-67-C-0045. Rand Corporation, Santa Monica, California.
   Google Scholar
• Mckoy , D and Egbelu , P . 1998 . Minimizing production flow time in a process and assembly job shop . International Journal of Production Research , 36 ( 8 ) : 2315 – 2332 .
   Web of Science ®Google Scholar
• Natarajan , K . 2007 . Performance evaluation of priority dispatching rules in multi-level assembly job shops with jobs having weights for flowtime and tardiness . International Journal of Advanced Manufacturing Technology , 31 ( 7–8 ) : 751 – 761 .
   Web of Science ®Google Scholar
• Nowicki , E and Smutnicki , C . 1996 . A fast taboo search algorithm for the job shop problem . Management Science , 42 ( 6 ) : 797 – 813 .
   Web of Science ®Google Scholar
• Park , M-W and Kim , Y-D . 1998 . A systematic procedure for setting parameters in simulated annealing algorithms . Computers & Operations Research , 25 ( 3 ) : 207 – 217 .
   Web of Science ®Google Scholar
• Philipoom , PR , Russell , RS and Fry , TD . 1991 . A preliminary investigation of multi-attribute based sequencing rules for assemble shops . International Journal of Production Research , 29 ( 4 ) : 739 – 753 .
   Web of Science ®Google Scholar
• Reeja , M and Rajendran , C . 2000 . Dispatching rules for scheduling in assembly jobshops – Part 1 . International Journal of Production Research , 38 ( 9 ) : 2051 – 2066 .
   Web of Science ®Google Scholar
• Russell , RS and Taylor , BW III . 1985 . An evaluation of sequencing rules for an assembly shop . Decision Sciences , 16 ( 2 ) : 196 – 212 .
   Web of Science ®Google Scholar
• Siegel, G., 1971. An investigation of job shop scheduling for jobs with assembly constraints. Unpublished dissertation (PhD). Cornell University, Ithaca, New York.
   Google Scholar
• Taillard, E., 1993. Benchmarks for basic scheduling problems. European Journal of Operations Research, 64 (2), 278–285.
   Google Scholar
• Thiagarajan , S and Rajendran , C . 2005 . Scheduling in dynamic assembly job-shops to minimize the sum of weighted earliness, weighted tardiness and weighted flowtime of jobs . Computers and Industrial Engineering , 49 ( 4 ) : 463 – 503 .
   Web of Science ®Google Scholar