Discovering the conditions under which an optimization algorithm or search heuristic will
succeed or fail is critical for understanding the strengths and weaknesses of different …

Recently, the importance of correctly designed computational experiments for testing
algorithms has been a subject of extended discussions. Whenever real-world data is …

This paper presents the salient aspects of a simulation study conducted to investigate the
interaction between due-date assignment methods and scheduling rules in a typical …

The technological advances recently brought to the manufacturing arena (collectively known
as Industry 4.0) offer huge possibilities to improve decision-making processes in the shop …

Traditional research on machine scheduling focuses on job allocation and sequencing to
optimize certain objective functions that are defined in terms of job completion times. With …

The online-to-offline (O2O) community supermarket is currently a popular O2O business
model in China. Owing to the small lot-size, high frequency, time-sensitive, and dynamic …

We consider a project selection problem where each project has an uncertain return with
partially characterized probability distribution. The decision maker selects a feasible subset …

As a typical manufacturing and scheduling problem with strong industrial background, flow
shop scheduling with limited buffers has gained wide attention both in academic and …

When a make-to-order manufacturing company adopts a commit-to-delivery business mode,
it commits a delivery due date for an order and is responsible for the shipping cost. Without …

This paper presents several new heuristics for the m-machine no-wait flowshop with total
completion time as the criterion. The performance of the proposed heuristics is compared …