This paper intends to address the distributed flexible job shop scheduling problem (DFJSP)
with minimizing maximum completion time (makespan). In order to solve this problem, we …

This paper discusses review of literature of open shop scheduling problems. First, the
problem is classified as per different measures of performance, viz., minimization of …

Regarding four different energy-conscious scheduling problems, namely, flexible job shop
scheduling problem (FJSP), FJSP with transportation time (FJSP-T), FJSP with sequence …

In recent years, researchers have been paying special attention to scheduling problems with
setup times and costs, aiming to adopt more realistic assumptions. This paper aims at …

In this paper, a novel variant of the open shop scheduling problem where the jobs have
sequence-dependent processing times is addressed. The performance measure considered …

This paper deals with the so-called Open Shop Scheduling Problem (OSSP) with makespan
objective, which consists of scheduling a set of jobs that must visit a set of machines in no …

This article presents a new variant for the open shop scheduling problem, the open shop
scheduling problem with repetitions (OSSPR), where the jobs can be processed on any …

The continuous evolution of manufacturing environments leads to a more efficient
production process that controls an increasing number of parameters. Production resources …

Maintenance and health care diagnostic systems are generally composed of different
workstations pertaining to technologically different processes. A workstation is composed of …

This paper considers an order acceptance and scheduling (OAS) problem in open shops
with m-machines and the objective of maximizing the total net revenue, which is defined as …