A Class of Single Machine Scheduling Problems with Variable Processing Time

A Class of Single Machine Scheduling Problems with Variable Processing Time

In this paper, single machine scheduling problems with variableprocessing time are raised. The criterions of the problem considered are minimizing scheduling length of all jobs, flow time and number of tardy jobs and so on. The complexity of the problem is determined.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:西南交通大学学报(英文版) 2001, Vol.9 (1), p.93-100
Hauptverfasser: Zhou Hefang, Zhou Xianwei
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, single machine scheduling problems with variableprocessing time are raised. The criterions of the problem considered are minimizing scheduling length of all jobs, flow time and number of tardy jobs and so on. The complexity of the problem is determined.
ISSN:1005-2429