The paper presents a survey of the results on the open shop scheduling problem to
minimize the makespan and its extensions. The focus is on the algorithms with provable …

In classical deterministic scheduling problems, it is assumed that all jobs have to be
processed. However, in many practical cases, mostly in highly loaded make-to-order …

We consider the no-wait flow shop scheduling problem with rejection. We first show how to
augment the travelling salesman problem formulation for the no-wait flow shop minimum …

As a subcategory of the classical flow shop scheduling problem, the ordered flow shop
scheduling problem deals with the case where processing times follow a specific structure …

One of the most popular ways of shopping in an omnichannel retailing environment is buy‐
online‐pickup‐in‐store (BOPS). Retailers often promise BOPS shoppers short in‐store …

We consider the robust (min-max regret) version of identical parallel machine scheduling
problem, in which jobs may be outsourced to balance total cost against production …

Ordered flow shop models have appeared in the literature since the mid‐1970s and
proportionate flow shop models have appeared since the early 1980s. We provide a …

This paper addresses the two-machine flow shop outsourcing and rescheduling problem
(TFSORP) in response to an unexpected arrival of new jobs, in which each job can be …

This paper considers a two-machine flowshop scheduling problem with outsourcing lead-
time. While the first operation of jobs can be either processed in-house or outsourced to …

In this paper, job shop scheduling problem with outsourcing options is considered and a
novel shuffled frog-leaping algorithm (SFLA) is presented to minimise total tardiness under …