Add to ORKGInternational audienceWe address a scheduling problem with a new criterion and unequal release dates. This new criterion results from a practical situation in the domain of book digitization. Given a set of job-independent delivery dates, the goal is to maximize the cumulative number of jobs processed before each delivery date. We establish the complexity of the general problem. In addition, we provide a pseudopolynomial time algorithm for the two delivery dates case based on dynamic programming, and we discuss some polynomial cases
AbstractIn this paper, we consider the problem of scheduling n deteriorating jobs with release dates...
This paper addresses the problem of scheduling n independent jobs on a single machine with a fixed u...
We consider the problem of scheduling n independent jobs on m identical machines that operate in par...
AbstractWe consider the nonpreemptive single machine scheduling problem with multiple due-dates (del...
The single machine scheduling problem with two types of controllable parameters, job processing time...
The single machine scheduling problems have been extensively studied with various criteria to be opt...
textabstractWe address the NP-hard problem of scheduling n independent jobs with release dates, due ...
We address the NP-hard problem of scheduling n independent jobs with release dates, due dates, and f...
The paper deals with the single-machine scheduling problem in which job processing times as well as ...
AbstractIn single machine scheduling with release dates and job delivery, jobs are processed on a si...
We consider the scheduling problem of minimizing the average weighted completion time of n jobs with...
This paper considers single-machine scheduling problems with simultaneous consideration of due date ...
We consider a problem of scheduling independent jobs on parallel machines to minimize the total comp...
Motivated by the conjecture that an interaction between scheduling and pre-scheduling phases in prod...
In most classical scheduling models, it is assumed that a job is dispatched to a customer immediatel...
AbstractIn this paper, we consider the problem of scheduling n deteriorating jobs with release dates...
This paper addresses the problem of scheduling n independent jobs on a single machine with a fixed u...
We consider the problem of scheduling n independent jobs on m identical machines that operate in par...
AbstractWe consider the nonpreemptive single machine scheduling problem with multiple due-dates (del...
The single machine scheduling problem with two types of controllable parameters, job processing time...
The single machine scheduling problems have been extensively studied with various criteria to be opt...
textabstractWe address the NP-hard problem of scheduling n independent jobs with release dates, due ...
We address the NP-hard problem of scheduling n independent jobs with release dates, due dates, and f...
The paper deals with the single-machine scheduling problem in which job processing times as well as ...
AbstractIn single machine scheduling with release dates and job delivery, jobs are processed on a si...
We consider the scheduling problem of minimizing the average weighted completion time of n jobs with...
This paper considers single-machine scheduling problems with simultaneous consideration of due date ...
We consider a problem of scheduling independent jobs on parallel machines to minimize the total comp...
Motivated by the conjecture that an interaction between scheduling and pre-scheduling phases in prod...
In most classical scheduling models, it is assumed that a job is dispatched to a customer immediatel...
AbstractIn this paper, we consider the problem of scheduling n deteriorating jobs with release dates...
This paper addresses the problem of scheduling n independent jobs on a single machine with a fixed u...
We consider the problem of scheduling n independent jobs on m identical machines that operate in par...