Publication:4884350
From MaRDI portal
zbMath0863.90096MaRDI QIDQ4884350
Publication date: 11 July 1996
due dates; NP-hardness; total tardiness on a single machine; two-machine flow shop problem with delays
90C60: Abstract computational complexity for mathematical programming problems
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays, Machine scheduling with transportation considerations, Makespan minimization for flow-shop problems with transportation times and a single robot, Polynomial-time approximation schemes for scheduling problems with time lags, Scheduling of coupled tasks with unit processing times, On-line two-machine job shop scheduling with time lags, On the reconstruction of binary and permutation matrices under (binary) tomographic constraints, Minimizing total completion time in two-machine flow shops with exact delays, The single-machine total tardiness scheduling problem: review and extensions, The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan, Coordinating multi-location production and customer delivery, Polynomial time algorithms for the UET permutation flowshop problem with time delays, Mapping filtering streaming applications, Approximation algorithms for UET scheduling problems with exact delays, Analysis of heuristics for the UET two-machine flow shop problem with time delays, Scheduling chains with identical jobs and constant delays on a single machine, Permutation flowshop scheduling problems with maximal and minimal time lags, On-line two-machine open shop scheduling with time lags, Transporting jobs through a two‐machine open shop
