Journal of Scheduling

Tang et al. (Eur J Oper Res 263:401–411, 2017) have recently introduced a parallel-batching machine scheduling problem with linearly deteriorating jobs of two agents and presented a computational complexity classification of various special cases …

Industries such as textiles, paints, chemicals, paper, drugs and pharmaceuticals operate as flow shops with sequence-dependent setup times (SDST). The sequence-dependent setup environment is characterised by the dependence of the setup time on the …

We consider two-machine flow shop scheduling problems with storage to minimize the makespan. Under a storage constraint, each job has its own size, and the total size of the job(s) being processed on the machine(s) and the job(s) waiting for the …

In this paper, we study a new type of flow shop and open shop models, which handle so-called “pliable” jobs: their total processing times are given, but individual processing times of operations which make up these jobs are flexible and need to be …

In this paper, we are concerned with the problem of scheduling n jobs on m machines. The job processing rate is interdependent and the jobs are non-preemptive. During the last several decades, a number of related models for parallel machine …