scientific article; zbMATH DE number 900396
From MaRDI portal
Publication:4884350
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
Cited in
(36)- 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
- Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
- On vanishing of Kronecker coefficients
- Coordinating multi-location production and customer delivery
- Approximating the 2-machine flow shop problem with exact delays taking two values
- Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times
- 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
- A note on scheduling coupled tasks for minimum total completion time
- Two machines flow shop with reentrance and exact time lag
- The two-machine no-wait general and proportionate open shop makespan problem
- An algorithm with bounds for the proportional case of a two-machine problem in flow-shop scheduling theory with minimum delays
- One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective
- A theoretical development for the total tardiness problem and its application in branch and bound algorithms
- Transporting jobs through a two‐machine open shop
- 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 the complexity of open shop scheduling with time lags
- Reentrant open shop scheduling problem with time lags and no-wait constraints
- Coupled-task scheduling with time windows, bounded pathwidth and bounded slack is para-NP-complete
- On the inapproximability of two-machine open shop scheduling with exact delays
- Transportation and delivery in flow-shop scheduling problems: a systematic review
- On the inapproximability of two-machine open shop scheduling with exact delays
- On-line two-machine job shop scheduling with time lags
- Exact method for the two-machine flow-shop problem with time delays
- On the reconstruction of binary and permutation matrices under (binary) tomographic constraints
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)
