The following pages link to (Q4884350):
Displayed 23 items.
- The two-machine no-wait general and proportionate open shop makespan problem (Q296784) (← links)
- A theoretical development for the total tardiness problem and its application in branch and bound algorithms (Q339575) (← links)
- Polynomial-time approximation schemes for scheduling problems with time lags (Q600835) (← links)
- Scheduling of coupled tasks with unit processing times (Q600841) (← links)
- On-line two-machine job shop scheduling with time lags (Q763542) (← links)
- On the reconstruction of binary and permutation matrices under (binary) tomographic constraints (Q952460) (← links)
- Minimizing total completion time in two-machine flow shops with exact delays (Q1000994) (← links)
- The single-machine total tardiness scheduling problem: review and extensions (Q1038369) (← links)
- The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan (Q1043332) (← links)
- On vanishing of Kronecker coefficients (Q1686840) (← links)
- Coordinating multi-location production and customer delivery (Q1936790) (← links)
- Polynomial time algorithms for the UET permutation flowshop problem with time delays (Q2384903) (← links)
- Mapping filtering streaming applications (Q2428659) (← links)
- Approximation algorithms for UET scheduling problems with exact delays (Q2457273) (← links)
- Analysis of heuristics for the UET two-machine flow shop problem with time delays (Q2482380) (← links)
- Scheduling chains with identical jobs and constant delays on a single machine (Q2500785) (← links)
- Permutation flowshop scheduling problems with maximal and minimal time lags (Q2581596) (← links)
- On-line two-machine open shop scheduling with time lags (Q2654315) (← links)
- Two machines flow shop with reentrance and exact time lag (Q2805477) (← links)
- Transporting jobs through a two‐machine open shop (Q3621908) (← links)
- A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays (Q5443372) (← links)
- Machine scheduling with transportation considerations (Q5932281) (← links)
- Makespan minimization for flow-shop problems with transportation times and a single robot (Q5946823) (← links)