Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints (Q5879664): Difference between revisions

Latest revision as of 14:19, 31 July 2024

scientific article; zbMATH DE number 7658673

Language	Label	Description	Also known as
English	Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints	scientific article; zbMATH DE number 7658673

Statements

instance of

scholarly article

0 references

title

Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints (English)

0 references

0 references

0 references

0 references

INFOR: Information Systems and Operational Research

0 references

publication date

2 March 2023

0 references

zbMATH Keywords

parallel machines

0 references

availability constraints

0 references

makespan

0 references

scheduling

0 references

semi-resumable jobs

0 references

non-resumable jobs

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/03155986.2016.1166795

0 references

cites work

Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan

0 references

Optimal parallel machines scheduling with availability constraints

0 references

Bounds on Multiprocessing Timing Anomalies

0 references

Q4934199

0 references

Makespan minimization for parallel machines scheduling with multiple availability constraints

0 references

Machine scheduling with an availability constraint

0 references

Two-machine flowshop scheduling with availability constraints

0 references

Makespan minimization for two parallel machines with an availability constraint

0 references

Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies

0 references

Identifiers

zbMATH Open document ID

1506.90092

0 references

DOI

10.1080/03155986.2016.1166795

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5879664

@@ Property / author @@
+Eldon A. Gunn
@@ Property / author: Eldon A. Gunn / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/03155986.2016.1166795
+Normal rank
@@ Property / OpenAlex ID @@
+W2338430224
@@ Property / OpenAlex ID: W2338430224 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
+Normal rank
@@ Property / cites work @@
+Optimal parallel machines scheduling with availability constraints
+Normal rank
@@ Property / cites work @@
+Bounds on Multiprocessing Timing Anomalies
@@ Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank @@
+Normal rank
@@ Property / cites work @@
+Q4934199
@@ Property / cites work: Q4934199 / rank @@
+Normal rank
@@ Property / cites work @@
+Makespan minimization for parallel machines scheduling with multiple availability constraints
+Normal rank
@@ Property / cites work @@
+Machine scheduling with an availability constraint
+Normal rank
@@ Property / cites work @@
+Two-machine flowshop scheduling with availability constraints
+Normal rank
@@ Property / cites work @@
+Makespan minimization for two parallel machines with an availability constraint
+Normal rank
@@ Property / cites work @@
+Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5879664