Single-machine sequencing with controllable processing times

Single-machine sequencing with controllable processing times

We consider a static single-machine sequencing problem which job processing times are controllable variables with linear costs. All jobs have a common due data. The objective is to find optimal processing times, an optimal due date and an optimal sequence which will minimize a cost function containi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:European journal of operational research 1992-06, Vol.59 (2), p.298-302
Hauptverfasser: Panwalkar, S.S., Rajagopalan, R.
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Costs
due date assignment
Exact sciences and technology
Job shops
Mathematical models
Operational research and scientific management
Operational research. Management science
Operations research
Processing
Scheduling
Scheduling, sequencing
Sequential scheduling
Timing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We consider a static single-machine sequencing problem which job processing times are controllable variables with linear costs. All jobs have a common due data. The objective is to find optimal processing times, an optimal due date and an optimal sequence which will minimize a cost function containing earliness cost, tardiness cost, and total processing cost.
ISSN:0377-2217
1872-6860
DOI:10.1016/0377-2217(92)90144-X