The job insertion problem in multi-stage scheduling is: given a schedule for n jobs and an additional job, find a feasible insertion of the additional job into the schedule that minimizes the resulting makespan. We prove that finding the optimal job insertion is NP-hard for flow shops and open shops
This paper considers a variant of the classical problem of minimizing makespan in a two-machine flow...
Abstract. This paper proposes a decomposition-based heuristic approach to minimizing the makespan of...
We investigate the multiprocessor multi-stage open-shop scheduling problem. In this variant of the o...
The job insertion problem in multi-stage scheduling is: given a schedule for n jobs and an additiona...
The Multi-Processor-Task Job Shop is an extension of the Job Shop problem where an operation of a jo...
AbstractThis note deals with the job insertion problem in job-shop scheduling: Given a feasible sche...
Insertion problems arise in scheduling when additional activities have to be inserted into a given s...
AbstractThis paper addresses job-shop scheduling problems with deteriorating jobs, i.e. jobs whose p...
Constructive heuristics for shop scheduling problems are often based on priority (or dispatching) ru...
This paper is a note on “Complexity analysis of job-shop scheduling with deteriorating jobs” [G. Mos...
AbstractThis paper deals with the problem of scheduling n jobs on m machines in order to minimize th...
It is well known that the minimal length non-preemptive scheduling problem for the general three-sta...
We consider the single machine multi-operation jobs scheduling problem to minimize the number of tar...
The paper deals with the determination of an optimal schedule for the so-called mixed-shop problem w...
Abstract. We study several combinatorial optimization problems which combine the classic shop schedu...
This paper considers a variant of the classical problem of minimizing makespan in a two-machine flow...
Abstract. This paper proposes a decomposition-based heuristic approach to minimizing the makespan of...
We investigate the multiprocessor multi-stage open-shop scheduling problem. In this variant of the o...
The job insertion problem in multi-stage scheduling is: given a schedule for n jobs and an additiona...
The Multi-Processor-Task Job Shop is an extension of the Job Shop problem where an operation of a jo...
AbstractThis note deals with the job insertion problem in job-shop scheduling: Given a feasible sche...
Insertion problems arise in scheduling when additional activities have to be inserted into a given s...
AbstractThis paper addresses job-shop scheduling problems with deteriorating jobs, i.e. jobs whose p...
Constructive heuristics for shop scheduling problems are often based on priority (or dispatching) ru...
This paper is a note on “Complexity analysis of job-shop scheduling with deteriorating jobs” [G. Mos...
AbstractThis paper deals with the problem of scheduling n jobs on m machines in order to minimize th...
It is well known that the minimal length non-preemptive scheduling problem for the general three-sta...
We consider the single machine multi-operation jobs scheduling problem to minimize the number of tar...
The paper deals with the determination of an optimal schedule for the so-called mixed-shop problem w...
Abstract. We study several combinatorial optimization problems which combine the classic shop schedu...
This paper considers a variant of the classical problem of minimizing makespan in a two-machine flow...
Abstract. This paper proposes a decomposition-based heuristic approach to minimizing the makespan of...
We investigate the multiprocessor multi-stage open-shop scheduling problem. In this variant of the o...
DOI
Add to ORKG