scientific article; zbMATH DE number 900396
From MaRDI portal
Publication:4884350
zbMATH Open0863.90096MaRDI QIDQ4884350FDOQ4884350
Authors: Wen-Ci Yu 
Publication date: 11 July 1996
Title of this publication is not available (Why is that?)
Recommendations
- Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
- The two-machine flowshop scheduling problem with total tardiness
- Two-machine flowshop scheduling to minimize the number of tardy jobs
- Minimizing Total Tardiness on One Machine is NP-Hard
- SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (32)
- Analysis of heuristics for the UET two-machine flow shop problem with time delays
- On-line two-machine open shop scheduling with time lags
- Exact method for the two-machine flow-shop problem with time delays
- Reentrant open shop scheduling problem with time lags and no-wait constraints
- Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times
- Machine scheduling with transportation considerations
- On vanishing of Kronecker coefficients
- On the reconstruction of binary and permutation matrices under (binary) tomographic constraints
- Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
- One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective
- Polynomial time algorithms for the UET permutation flowshop problem with time delays
- The two-machine no-wait general and proportionate open shop makespan problem
- Coordinating multi-location production and customer delivery
- Polynomial-time approximation schemes for scheduling problems with time lags
- Scheduling of coupled tasks with unit processing times
- A note on scheduling coupled tasks for minimum total completion time
- On the complexity of open shop scheduling with time lags
- A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays
- A theoretical development for the total tardiness problem and its application in branch and bound algorithms
- Approximation algorithms for UET scheduling problems with exact delays
- Transporting jobs through a two‐machine open shop
- On-line two-machine job shop scheduling with time lags
- Minimizing total completion time in two-machine flow shops with exact delays
- Scheduling chains with identical jobs and constant delays on a single machine
- The single-machine total tardiness scheduling problem: review and extensions
- Approximating the 2-machine flow shop problem with exact delays taking two values
- Makespan minimization for flow-shop problems with transportation times and a single robot
- Two machines flow shop with reentrance and exact time lag
- An algorithm with bounds for the proportional case of a two-machine problem in flow-shop scheduling theory with minimum delays
- Permutation flowshop scheduling problems with maximal and minimal time lags
- The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan
- Mapping filtering streaming applications
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4884350)
