AbstractWe show that the problem of minimizing the weighted number of late jobs in open shop with given release dates and unit time operations is strongly NP-hard. The complexity status of this problem was unknown
AbstractThis paper examines the openshop problem with machine dependent processing times. Two object...
We study various classical Open Shop scheduling problems to minimize the makespan. For problems whic...
The computational complexity of the problem of scheduling a set of start-time dependent tasks with d...
AbstractWe show that the problem of minimizing the weighted number of late jobs in open shop with gi...
AbstractThis paper considers the problem of minimizing the weighted number of late jobs in the two-m...
We consider a two-machine open shop problem where the jobs have release dates and due dates, and whe...
AbstractThis paper gives the positive answer to the question posed in the title for a wide class of ...
AbstractThis paper deals with the problem of scheduling n jobs on m machines in order to minimize th...
AbstractWe study the problem of constructing a minimum makespan schedule for the n-jobm-machine open...
The paper concerns the application of a non-classical performance measure, a late work criterion (Y,...
AbstractThe paper concerns the application of a non-classical performance measure, a late work crite...
AbstractWe study open-shop scheduling problems with job release times. The objective is to minimize ...
In this note we provide new complexity and algorithmic results for scheduling inventory releasing jo...
We consider a relaxed version of the open shop scheduling problem - the "concurrent open shop" sched...
AbstractMinimizing the number of precedence constrained, unit-time tardy jobs is strongly NP-hard on...
AbstractThis paper examines the openshop problem with machine dependent processing times. Two object...
We study various classical Open Shop scheduling problems to minimize the makespan. For problems whic...
The computational complexity of the problem of scheduling a set of start-time dependent tasks with d...
AbstractWe show that the problem of minimizing the weighted number of late jobs in open shop with gi...
AbstractThis paper considers the problem of minimizing the weighted number of late jobs in the two-m...
We consider a two-machine open shop problem where the jobs have release dates and due dates, and whe...
AbstractThis paper gives the positive answer to the question posed in the title for a wide class of ...
AbstractThis paper deals with the problem of scheduling n jobs on m machines in order to minimize th...
AbstractWe study the problem of constructing a minimum makespan schedule for the n-jobm-machine open...
The paper concerns the application of a non-classical performance measure, a late work criterion (Y,...
AbstractThe paper concerns the application of a non-classical performance measure, a late work crite...
AbstractWe study open-shop scheduling problems with job release times. The objective is to minimize ...
In this note we provide new complexity and algorithmic results for scheduling inventory releasing jo...
We consider a relaxed version of the open shop scheduling problem - the "concurrent open shop" sched...
AbstractMinimizing the number of precedence constrained, unit-time tardy jobs is strongly NP-hard on...
AbstractThis paper examines the openshop problem with machine dependent processing times. Two object...
We study various classical Open Shop scheduling problems to minimize the makespan. For problems whic...
The computational complexity of the problem of scheduling a set of start-time dependent tasks with d...
DOI
Add to ORKG