Journal of Scheduling

article

Editorial 10th anniversary volume (volume 11)

Mike Pinedo, Steef Velde

Journal of Scheduling > 2008 > 11 > 1 > 1-1

article

Batch scheduling of step deteriorating jobs

M. S. Barketau, T. C. E. Cheng, C. T. Ng, Vladimir Kotov, more

Journal of Scheduling > 2008 > 11 > 1 > 17-28

In this paper we consider the problem of scheduling n jobs on a single machine, where the jobs are processed in batches and the processing time of each job is a step function depending on its waiting time, which is the time between the start of the processing of the batch to which the job belongs and the start of the processing of the job. For job i, if its waiting time is less than a given threshold...

article

Minimizing the number of tardy jobs with stochastically-ordered processing times

Dan Trietsch, Kenneth R. Baker

Journal of Scheduling > 2008 > 11 > 1 > 71-73

We consider the single-machine sequencing model with stochastic processing times and the problem of minimizing the number of stochastically tardy jobs. In general, this problem is NP-hard. Recently, however, van den Akker and Hoogeveen found some special cases that could be solved in polynomial time. We generalize their findings by providing a polynomial time solution for any stochastically ordered...

article

Preemptive open shop scheduling with multiprocessors: polynomial cases and applications

Dominique Werra, Tamás Kis, Wieslaw Kubiak

Journal of Scheduling > 2008 > 11 > 1 > 75-83

This paper addresses a multiprocessor generalization of the preemptive open-shop scheduling problem. The set of processors is partitioned into two groups and the operations of the jobs may require either single processors in either group or simultaneously all processors from the same group. We consider two variants depending on whether preemptions are allowed at any fractional time points or only...

article

Minimizing the number of late jobs in a stochastic setting using a chance constraint

Marjan Akker, Han Hoogeveen

Journal of Scheduling > 2008 > 11 > 1 > 59-69

We consider the single-machine scheduling problem of minimizing the number of late jobs. We omit here one of the standard assumptions in scheduling theory, which is that the processing times are deterministic. In this scheduling environment, the completion times will be stochastic variables as well. Instead of looking at the expected number of on time jobs, we present a new model to deal with the...

article

A GRASP approach for the extended car sequencing problem

Joaquín Bautista, Jordi Pereira, Belarmino Adenso-Díaz

Journal of Scheduling > 2008 > 11 > 1 > 3-16

This paper presents a solution procedure for a new variant of the Car Sequencing Problem (CSP) based on the GRASP metaheuristic. In this variant, called xCSP (extended CSP), the aim is to satisfy the hard constraints of the CSP while scheduling the maximum possible number of cars with specific options at specific times of the day in order to satisfy other production requirements. Additional constraint...

article

A multi-criteria approach for scheduling semiconductor wafer fabrication facilities

Michele E. Pfund, Hari Balasubramanian, John W. Fowler, Scott J. Mason, more

Journal of Scheduling > 2008 > 11 > 1 > 29-47

In this research, we model a semiconductor wafer fabrication process as a complex job shop, and adapt a Modified Shifting Bottleneck Heuristic (MSBH) to facilitate the multi-criteria optimization of makespan, cycle time, and total weighted tardiness using a desirability function. The desirability function is implemented at two different levels of the MSBH: the subproblem solution procedure level (SSP...

article

A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem

Francis Sourd, Safia Kedad-Sidhoum

Journal of Scheduling > 2008 > 11 > 1 > 49-58

This paper addresses the one-machine scheduling problem with earliness-tardiness penalties. We propose a new branch-and-bound algorithm that can solve instances with up to 50 jobs and that can solve problems with even more general non-convex cost functions. The algorithm is based on the combination of a Lagrangean relaxation of resource constraints and new dominance rules.

INFONA - science communication portal

Journal of Scheduling

Editorial 10th anniversary volume (volume 11)

Batch scheduling of step deteriorating jobs

Minimizing the number of tardy jobs with stochastically-ordered processing times

Preemptive open shop scheduling with multiprocessors: polynomial cases and applications

Minimizing the number of late jobs in a stochastic setting using a chance constraint

A GRASP approach for the extended car sequencing problem

A multi-criteria approach for scheduling semiconductor wafer fabrication facilities

A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem

Filter options

Publication date

Keywords

INFONA - science communication portal

Journal of Scheduling

Add recipient

Sending message cancelled

Are you sure you want to cancel sending this message?

Send message

Filter options

Publication date

Date range setting

Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.

Keywords

Reporting an error / abuse

Sending the report failed

Accessibility options