Job shop scheduling with deadlines

DOI10.1023/A:1009750409895zbMath0897.90120OpenAlexW1495260753MaRDI QIDQ1383797

Alkiviadis Vazacopoulos, Giuseppe Lancia, Egon Balas, Paolo Serafini

Publication date: 13 April 1998

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009750409895

zbMATH Keywords

schedulingdeadlinesmakespan minimizationjob-shop schedulingshifting bottleneck

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (6)

A multi-criteria approach for scheduling semiconductor wafer fabrication facilities ⋮ Job shop scheduling with setup times, deadlines and precedence constraints ⋮ New single machine and job-shop scheduling problems with availability constraints ⋮ Minimizing L _max for large-scale, job-shop scheduling problems ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ Decision Incorporation in Meta-heuristics to Cope with Decision Scheduling Problems

This page was built for publication: Job shop scheduling with deadlines