On the complexity of open shop scheduling with time lags

07/16/2021
by   Wieslaw Kubiak, et al.
0

The minimization of makespan in open shop with time lags has been shown NP-hard in the strong sense even for the case of two machines and unit-time operations. The minimization of total completion time however has remained open for that case though it has been shown NP-hard in the strong sense for weighted total completion time or for jobs with release dates. This note shows that the minimization of total completion time for two machines and unit-time operations is NP-hard in the strong sense which answers the long standing open question.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/24/2020

Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines

The task of scheduling jobs to machines while minimizing the total makes...
research
11/12/2020

Total Completion Time Minimization for Scheduling with Incompatibility Cliques

This paper considers parallel machine scheduling with incompatibilities ...
research
01/14/2020

Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution

We give a 1.488-approximation for the classic scheduling problem of mini...
research
06/26/2022

Hardness of Interval Scheduling on Unrelated Machines

We provide new (parameterized) computational hardness results for Interv...
research
02/26/2014

Evolutionary solving of the debts' clearing problem

The debts' clearing problem is about clearing all the debts in a group o...
research
12/28/2019

A Note on the Asymptotic Optimality of Work-Conserving Disciplines in Completion Time Minimization

In this paper, we prove that under mild stochastic assumptions, work-con...
research
04/25/2023

Simply Realising an Imprecise Polyline is NP-hard

We consider the problem of deciding, given a sequence of regions, if the...

Please sign up or login with your details

Forgot password? Click here to reset