This paper considers the identical parallel machines scheduling problem (PMSP) with a
single server in charge of job setups. A job can be processed with a precedent setup by a …

There is a limited number of results concerning fast and efficient solution algorithms for
scheduling problems with general learning models. Therefore, we develop a fast insert …

Since 2000, the field of machine scheduling—an integral part of computer science and
operations research—has seen significant advancements. This paper explores the dynamic …

The problem of sequencing jobs on a single machine to minimize total cost (earliness and
tardiness) is nowadays not just important due to traditional concerns but also due to its …

The research in the field of robust scheduling aims at devising schedules which are not
sensitive—to a certain extent—to the disruptive effects of unexpected events. Nevertheless …

In this paper, we consider the single-machine scheduling problem with given release dates
and the objective to minimize the maximum penalty which is NP-hard in the strong sense …

This paper examines a single machine scheduling problem of minimizing the maximum
scheduling cost that is nondecreasing with job completion time. Job release dates and …

This paper introduces a novel generic optimization framework for scheduling problems with
machine deterioration and maintenance activities. The framework employs computationally …

This paper presents a hybrid meta-heuristic search procedure to solve the well-known single
machine scheduling problem to minimize the maximum lateness over all jobs, where …

This paper concentrates on the scheduling problem in seru production system (SPS), which
is a new-type advanced system with high manufacturing flexibility to response the volatile …