A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints

We study several two-machine shop scheduling problems, namely flow shop, job shop and open shop scheduling problems under linear constraints. In these problems, the processing times of two stages of jobs are also decision variables and satisfy a system of linear constraints. The goal of each problem...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of scheduling Ročník 26; číslo 6; s. 543 - 558
Hlavní autori:	Nip, Kameng, Wang, Zhenbo
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.12.2023 Springer Nature B.V
Predmet:	Algorithms Approximation Artificial Intelligence Business and Management Calculus of Variations and Optimal Control; Optimization Completion time Complexity Job shop scheduling Job shops Machine shops Operations Research/Decision Theory Optimization Polynomials Production scheduling Scheduling Supply Chain Management Open shop scheduling Linear programming Job shop scheduling Computational complexity Flow shop scheduling
ISSN:	1094-6136, 1099-1425
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!