32
Views
36
CrossRef citations to date
0
Altmetric
Original Articles

On the Use of A Vehicle Routing Algorithm for the Parallel Processor Problem with Sequence Dependent Changeover Costs

, &
Pages 155-160 | Received 01 Oct 1975, Published online: 09 Jul 2007

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (12)

René Drießel & Lars Mönch. (2012) An integrated scheduling and material-handling approach for complex job shops: a computational study. International Journal of Production Research 50:20, pages 5966-5985.
Read now
W.L. PEARN, S.H. CHUNG & M.H. YANG. (2002) Minimizing the total machine workload for the wafer probing scheduling problem. IIE Transactions 34:2, pages 211-220.
Read now
W. L. Pearn, S. H. Chung & M. H. Yang. (2002) A case study on the wafer probing scheduling problem. Production Planning & Control 13:1, pages 66-75.
Read now
M.E. Kurz & R. G. Askin. (2001) Heuristic scheduling of parallel machines with sequence-dependent set-up times. International Journal of Production Research 39:16, pages 3747-3769.
Read now
S. H. Chung, W. L. Pearn & M. H. Yang. (2000) 晶圓針測廠排程演算法之設計. Journal of the Chinese Institute of Industrial Engineers 17:3, pages 321-329.
Read now
M. BRANDOLESE, M. FRANCI & A. POZZETTI*. (1996) Production and maintenance integrated planning. International Journal of Production Research 34:7, pages 2059-2075.
Read now
I. M. OVACIK & R. UZSOY. (1995) Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times. International Journal of Production Research 33:11, pages 3173-3192.
Read now
S. C. KIM & P. M. BOBROWSKI. (1994) Impact of sequence-dependent setup time on job shop scheduling performance. International Journal of Production Research 32:7, pages 1503-1520.
Read now
A. GUINET. (1993) Scheduling sequence-dependent jobs on identical parallel machines to minimize completion time criteria. International Journal of Production Research 31:7, pages 1579-1594.
Read now
K. BELARBI & K. S. HINDI. (1992) Detailed scheduling for a class of two-stage intermittent manufacturing systems. Production Planning & Control 3:1, pages 36-47.
Read now
BELLURN. SRIKAR & SOUMEN GHOSH. (1986) A MILP model for the n-job, M-stage flowshop with sequence dependent set-up times. International Journal of Production Research 24:6, pages 1459-1474.
Read now
SUSHILK. GUPTA. (1982) n jobs and m machines job-shop problems with sequence-dependent set-up times. International Journal of Production Research 20:5, pages 643-656.
Read now

Articles from other publishers (24)

Fengteng Dai & Deming Lei. (2023) An imperialist competitive algorithm with adaptive cooperation for resource-constrained unrelated parallel machines scheduling with setup time. An imperialist competitive algorithm with adaptive cooperation for resource-constrained unrelated parallel machines scheduling with setup time.
Deming Lei & Hai Yang. (2022) Scheduling unrelated parallel machines with preventive maintenance and setup time: Multi-sub-colony artificial bee colony. Applied Soft Computing 125, pages 109154.
Crossref
Fernanda F. Alves, Thiago H. Nogueira & Martín G. Ravetti. (2022) Learning algorithms to deal with failures in production planning. Computers & Industrial Engineering 169, pages 108231.
Crossref
Fernanda F. Alves & Martin G. Ravetti. (2022) Efficiency comparison of proactive approaches to deal with machine failures*. IFAC-PapersOnLine 55:10, pages 767-772.
Crossref
Rodney Oliveira Marinho Diana, Sérgio Ricardo de Souza & Elizabeth Fialho Wanner. (2021) A robust multi-response VNS-aiNet approach for solving scheduling problems under unrelated parallel machines environments. Expert Systems with Applications 182, pages 115140.
Crossref
Deming Lei & Tian Yi. (2021) A Novel Shuffled Frog-Leaping Algorithm for Unrelated Parallel Machine Scheduling with Deteriorating Maintenance and Setup Time. Symmetry 13:9, pages 1574.
Crossref
Mei Wang & Guohua Pan. (2019) A Novel Imperialist Competitive Algorithm With Multi-Elite Individuals Guidance for Multi-Object Unrelated Parallel Machine Scheduling Problem. IEEE Access 7, pages 121223-121235.
Crossref
Rodney Oliveira Marinho Diana, Moacir Felizardo de França Filho, Sérgio Ricardo de Souza & João Francisco de Almeida Vitor. (2015) An immune-inspired algorithm for an unrelated parallel machines’ scheduling problem with sequence and machine dependent setup-times for makespan minimisation. Neurocomputing 163, pages 94-105.
Crossref
Rodney O.M. Diana, Moacir F. de F. Filho, Sergio R. de Souza & Maria Amelia L. Silva. (2013) A Clonal Selection Algorithm for Makespan Minimization on Unrelated Parallel Machines with Sequence Dependent Setup Times. A Clonal Selection Algorithm for Makespan Minimization on Unrelated Parallel Machines with Sequence Dependent Setup Times.
Chin-Chih Chang & Feng-Chia Li. (2013) Solving the wafer probing scheduling problem using water flow-like algorithm. Solving the wafer probing scheduling problem using water flow-like algorithm.
Melissa R. Bowers & Anurag Agarwal. (2007) Fewer Equipment Changeovers for the Embroidery Process at Oxford Industries. Interfaces 37:6, pages 526-538.
Crossref
Vinícius Amaral Armentano & Moacir Felizardo de França Filho. (2007) Minimizing total tardiness in parallel machine scheduling with setup times: An adaptive memory-based GRASP approach. European Journal of Operational Research 183:1, pages 100-114.
Crossref
Jeng-Fung Chen. (2004) Unrelated parallel machine scheduling with secondary resource constraints. The International Journal of Advanced Manufacturing Technology 26:3, pages 285-292.
Crossref
Pei-Chann Chang, Jih-Chang Hsieh & Yen-Wen Wang. (2003) Genetic algorithms applied in BOPP film scheduling problems: minimizing total absolute deviation and setup times. Applied Soft Computing 3:2, pages 139-148.
Crossref
Chang Ouk Kim & Hyun Joon Shin. (2003) Scheduling jobs on parallel machines: a restricted tabu search approach. The International Journal of Advanced Manufacturing Technology 22:3-4, pages 278-287.
Crossref
Ali Allahverdi, Jatinder N.D Gupta & Tariq Aldowaisan. (1999) A review of scheduling research involving setup considerations. Omega 27:2, pages 219-239.
Crossref
Turaj Tahmassebi. 1999. Operational Research in Industry. Operational Research in Industry 102 134 .
Paulo M. França, Michel Gendreau, Gilbert Laporte & Felipe M. Müller. (1996) A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times. International Journal of Production Economics 43:2-3, pages 79-89.
Crossref
Gündüz Ulusoy & Reha Uzsoy. (1994) A robust strategy approach to a strategic mobility problem. European Journal of Operational Research 79:2, pages 266-276.
Crossref
Gotha. (2011) Les problèmes d'ordonnancement. RAIRO - Operations Research 27:1, pages 77-150.
Crossref
K. S. Hindi & K. Belarbi. (1992) Detailed scheduling of a packing system. The International Journal of Advanced Manufacturing Technology 7:4, pages 218-224.
Crossref
Christopher S. Tang. (1990) Scheduling batches on parallel machines with major and minor set-ups. European Journal of Operational Research 46:1, pages 28-37.
Crossref
Mohamed Haouari, Pierre Dejax & Martin Desrochers. (2011) Les problèmes de tournées avec contraintes de fenêtres de temps, l'état de l'art. RAIRO - Operations Research 24:3, pages 217-244.
Crossref
Samuel Raff. (1983) Routing and scheduling of vehicles and crews. Computers & Operations Research 10:2, pages 63-211.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.