We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic ...
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 depe...
M. S. Barketau, T. C. Edwin Cheng, C. T. Ng, Vladi...
This paper discusses a real-world application of simulation to schedule operator and machine resources in a floor tile manufacturing plant. The paper discusses attempts at using a...
Hank Czarnecki, Bernard J. Schroer, M. Mizzanur Ra...
When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance.A well-known example for such a cas...
In this paper we study the job shop scheduling problem under the assumption that the jobs have controllable processing times. The fact that the jobs have controllable processing t...
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-O...