The single machine scheduling problem with a common due date and non-identical ready times for the jobs is examined in this work. Performance is measured by the minimization of the weighted sum of earliness and tardiness penalties of the jobs. Since this problem is NP-hard, the application of constructive heuristics that exploit specific characteristics of the problem to improve their performance is investigated. The proposed approaches are examined through a computational comparative study on a set of 280 benchmark test problems with up to 1000 jobs
19 pages, 4 figuresIn this paper, we focus on the solution of a hard single machine scheduling probl...
The problem of sequencing jobs on a single machine to minimize total cost (earliness and tardiness) ...
International audienceComing from the ldquojust-in-timerdquo philosophy in management and production...
The single machine scheduling problem with a common due date and non-identical ready times for the j...
The problem of scheduling jobs with distinct ready times and due dates in a single machine to minimi...
This paper addresses the single machine scheduling problem with a common due date aiming to minimize...
This paper considers the common due date assignment for single machine weighted earliness/tardiness ...
This paper addresses the problem of scheduling n independent jobs on a single machine with a fixed u...
The urge to produce products in the production line at a faster rate with no compromise in quality h...
In this paper are applied heuristics that try to find good solutions for a static single machine sch...
The problem addressed in this paper is the two-machine job shop scheduling problem when the objectiv...
Abstract: In this paper we consider a total penalty for the n job, one machine scheduling problem in...
International audienceThis paper deals with a common due date parallel machines scheduling problem i...
This chapter deals with common due date scheduling problem on single and parallel machines in which ...
This paper is concerned with the optimal due dates and the optimal sequence to a set of jobs on a si...
19 pages, 4 figuresIn this paper, we focus on the solution of a hard single machine scheduling probl...
The problem of sequencing jobs on a single machine to minimize total cost (earliness and tardiness) ...
International audienceComing from the ldquojust-in-timerdquo philosophy in management and production...
The single machine scheduling problem with a common due date and non-identical ready times for the j...
The problem of scheduling jobs with distinct ready times and due dates in a single machine to minimi...
This paper addresses the single machine scheduling problem with a common due date aiming to minimize...
This paper considers the common due date assignment for single machine weighted earliness/tardiness ...
This paper addresses the problem of scheduling n independent jobs on a single machine with a fixed u...
The urge to produce products in the production line at a faster rate with no compromise in quality h...
In this paper are applied heuristics that try to find good solutions for a static single machine sch...
The problem addressed in this paper is the two-machine job shop scheduling problem when the objectiv...
Abstract: In this paper we consider a total penalty for the n job, one machine scheduling problem in...
International audienceThis paper deals with a common due date parallel machines scheduling problem i...
This chapter deals with common due date scheduling problem on single and parallel machines in which ...
This paper is concerned with the optimal due dates and the optimal sequence to a set of jobs on a si...
19 pages, 4 figuresIn this paper, we focus on the solution of a hard single machine scheduling probl...
The problem of sequencing jobs on a single machine to minimize total cost (earliness and tardiness) ...
International audienceComing from the ldquojust-in-timerdquo philosophy in management and production...
Add to ORKG