Idioma:

Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine

Wu, Chin-Chia ; Lee, Wen-Chiung

Information processing letters, 2003-07, Vol.87 (2), p.89-93 [Periódico revisado por pares]

Texto completo disponível

Citações Citado por

Título:
Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
Autor: Wu, Chin-Chia ; Lee, Wen-Chiung
Assuntos: Applied sciences ; Automata. Abstract machines. Turing machines ; Availability constraint ; Computer science; control theory; systems ; Computer systems performance. Reliability ; Deteriorating job ; Exact sciences and technology ; Integer programming ; Job shops ; Linear programming ; Makespan ; Operational research and scientific management ; Operational research. Management science ; Scheduling ; Scheduling, sequencing ; Single machine ; Software ; Theoretical computing
É parte de: Information processing letters, 2003-07, Vol.87 (2), p.89-93
Descrição: The scheduling problem with deteriorating jobs to minimize the makespan on a single machine where the facility has an availability constraint is studied in this paper. By a deteriorating job we mean that the processing time for the job is a function of its starting time. Even with the introduction of the availability to a facility, the linear deteriorating model can be solved using the 0–1 integer programming technique if the actual job processing time is proportional to the starting time.
Editor: Amsterdam: Elsevier B.V
Idioma: Inglês

Links

Voltar para lista de resultados