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 50 items.
- The focus of attention problem (Q262243) (← links)
- Computational complexity of manipulation: a survey (Q334204) (← links)
- 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)
- Frugal bribery in voting (Q527399) (← 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)
- Exact method for the two-machine flow-shop problem with time delays (Q829189) (← links)
- Two-machine interval shop scheduling with time lags (Q892834) (← links)
- Flowshop scheduling with interstage job transportation (Q892841) (← links)
- Optimal control of a two-server flow-shop network (Q892910) (← 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)
- The coupled unit-time operations problem on identical parallel machines with respect to the makespan (Q1667166) (← links)
- On the complexity of the unit commitment problem (Q1730706) (← links)
- Minimizing flowtime for paired tasks (Q1751895) (← links)
- Preemptive scheduling on two identical parallel machines with a single transporter (Q1944394) (← links)
- Scheduling coupled tasks with exact delays for minimum total job completion time (Q2061138) (← links)
- Coupled task scheduling with time-dependent processing times (Q2061140) (← links)
- Optimizing consolidation processes in hubs: the hub-arrival-departure problem (Q2076886) (← links)
- Approximating the 2-machine flow shop problem with exact delays taking two values (Q2174271) (← links)
- Distance restricted manipulation in voting (Q2235758) (← links)
- Control complexity in Borda elections: solving all open cases of offline control and some cases of online control (Q2238692) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- Efficient reallocation under additive and responsive preferences (Q2272381) (← links)
- Coupled task scheduling with exact delays: literature review and models (Q2282490) (← links)
- Mixed integer linear programming models for flow shop scheduling with a demand plan of job types (Q2303310) (← links)
- Two-machine flowshop scheduling problem with coupled-operations (Q2327688) (← links)
- Polynomial time algorithms for the UET permutation flowshop problem with time delays (Q2384903) (← links)
- The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays (Q2400440) (← 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)
- A note on scheduling coupled tasks for minimum total completion time (Q2678608) (← links)
- Strategic voting in negotiating teams (Q2695442) (← links)
- Two machines flow shop with reentrance and exact time lag (Q2805477) (← links)
- (Q2861551) (← links)
- SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS (Q3434279) (← links)
- Transporting jobs through a two‐machine open shop (Q3621908) (← links)
- (Q5089119) (← 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)
- An efficient heuristic method for joint optimization of train scheduling and stop planning on double-track railway systems (Q5882416) (← links)