scientific article; zbMATH DE number 900396
From MaRDI portal
Publication:4884350
zbMath0863.90096MaRDI QIDQ4884350
Publication date: 11 July 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (29)
Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic ⋮ Exact method for the two-machine flow-shop problem with time delays ⋮ The two-machine no-wait general and proportionate open shop makespan problem ⋮ Polynomial time algorithms for the UET permutation flowshop problem with time delays ⋮ A theoretical development for the total tardiness problem and its application in branch and bound algorithms ⋮ On-line two-machine open shop scheduling with time lags ⋮ Polynomial-time approximation schemes for scheduling problems with time lags ⋮ Scheduling of coupled tasks with unit processing times ⋮ Approximating the 2-machine flow shop problem with exact delays taking two values ⋮ On vanishing of Kronecker coefficients ⋮ A note on scheduling coupled tasks for minimum total completion time ⋮ Coordinating multi-location production and customer delivery ⋮ On the complexity of open shop scheduling with time lags ⋮ Mapping filtering streaming applications ⋮ Approximation algorithms for UET scheduling problems with exact delays ⋮ On the reconstruction of binary and permutation matrices under (binary) tomographic constraints ⋮ Analysis of heuristics for the UET two-machine flow shop problem with time delays ⋮ Machine scheduling with transportation considerations ⋮ Makespan minimization for flow-shop problems with transportation times and a single robot ⋮ Scheduling chains with identical jobs and constant delays on a single machine ⋮ A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays ⋮ Minimizing total completion time in two-machine flow shops with exact delays ⋮ Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times ⋮ Two machines flow shop with reentrance and exact time lag ⋮ Transporting jobs through a two‐machine open shop ⋮ On-line two-machine job shop scheduling with time lags ⋮ 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 ⋮ Permutation flowshop scheduling problems with maximal and minimal time lags
This page was built for publication:
