Pages that link to "Item:Q2464428"
From MaRDI portal
The following pages link to Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard (Q2464428):
Displayed 23 items.
- Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules (Q464615) (← links)
- Manipulation can be hard in tractable voting systems even for constant-sized coalitions (Q465694) (← links)
- Polynomial-time approximation schemes for scheduling problems with time lags (Q600835) (← links)
- Scheduling coupled-operation jobs with exact time-lags (Q714025) (← links)
- On-line two-machine job shop scheduling with time lags (Q763542) (← links)
- Scheduling problems in master-slave model (Q940888) (← links)
- Profit-based latency problems on the line (Q943793) (← links)
- Multigraph realizations of degree sequences: Maximization is easy, minimization is hard (Q957360) (← links)
- A note on the hardness of Skolem-type sequences (Q972331) (← links)
- Minimizing total completion time in two-machine flow shops with exact delays (Q1000994) (← links)
- Improved analysis of an algorithm for the coupled task problem with UET jobs (Q1015304) (← links)
- The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan (Q1043332) (← links)
- Preemptive scheduling on two identical parallel machines with a single transporter (Q1944394) (← 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)
- Permutation flowshop scheduling problems with maximal and minimal time lags (Q2581596) (← links)
- (Q2861551) (← links)
- SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS (Q3434279) (← 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)
- Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays (Q5505680) (← links)