Data/hora: 05/06/2024 03:42:21

Biblioteca(s): 	Embrapa Agricultura Digital.	
Data corrente: 	03/10/1995	
Data da última atualização: 	02/04/2019	
Autoria: 	CHEN, C.-L.; BULFIN, R. L.	
Afiliação: 	CHUEN-LUNG CHEN, Departament of Industrial Engineering/Mississipi State University; ROBERT L. BULFIN, Department of Industrial Engineering/Auburn University.	
Título: 	Scheduling a single machine to minimize two criteria: maximum tardiness and number of tardy jobs.	
Ano de publicação: 	1994	
Fonte/Imprenta: 	IIE Transactions, v. 26, n. 5, 1994. p. 76-84.	
Idioma: 	Inglês	
Conteúdo: 	In this paper we consider a single machine scheduling problem with two criteria; minimizing both maximum tardiness and the number of tardy jobs. We present both heuristic and branch-and-bound algorithms to find the schedule which minimizes the number of taedy jobs among all schedules having minimal maximum tardiness. Computational results show thatproblems with up to 40 jobs can be solved in less than one minute of computer time, and soultion difficulty tends to increase as the range of due dates increases relative to the total processing time. We extend our results to ge nerate all nondominated schedules for the two criteria. Computational experiments indicate that all non-dominated solutions to problems with 40 jobs can be generated. However, solution difficculty for these problems is highly dependent on problem parameters.	
Palavras-Chave: 	Maximum tardiness; Tardy jobs.	
Thesagro: 	Programa de Computador.	
Categoria do assunto: 	X Pesquisa, Tecnologia e Engenharia	
Registro original: 	Embrapa Agricultura Digital (CNPTIA)	
Exemplares: 	CNPTIA - (2592-1) - ADC - AP - DD -  -  -  - DIS