This paper proposes a methodology for real-time job-shop scheduling problems. It introduces a new classification of the scheduling methods for JSSPs with emphasis on the search methods and the significance of the search space. Subsequently, a machine-order search space is proposed as a new framework in which different single-machine scheduling algorithms and search methods can be incorporated t...

A batch machine is a machine that can process up to c jobs simultaneously as a batch, and the processing time of the batch is equal to the longest processing time of the jobs assigned to it. In this paper, we deal with the complexity of scheduling an unbounded batch machine, i.e., c = +∞. We prove that minimizing total tardiness is binary NP-hard, which has been an open problem in the literatur...

This paper presents a novel, integer-linear programming (ILP) model for an identical parallel-machine scheduling problem with family setup times that minimizes the total weighted flow time (TWFT). Some researchers have addressed parallel-machine scheduling problems in the literature over the last three decades. However, the existing studies have been limited to the research of independent jobs,...

this study investigates the coordination of production scheduling and maintenance planning in theflow shop scheduling environment. the problem is considered in a bi-objective form, minimizing themakespan as the production scheduling criterion and minimizing the system unavailability as themaintenance planning criterion. the time interval between consecutive maintenance activities as well as the...

We consider the single machine scheduling problem with job-dependent machine deterioration. In the problem, we are given a single machine with an initial non-negative maintenance level, and a set of jobs each with a non-preemptive processing time and a machine deterioration. Such a machine deterioration quantifies the decrement in the machine maintenance level after processing the job. To avoid...

This paper focuses on a stochastic scheduling problem in which n immediately available jobs are to be scheduled jointly with the preventive maintenance in a single machine subject to breakdowns. The objective is to minimize expected total earliness and tardiness costs with a common due-date. The problem of scheduling only n jobs to minimize total earliness and tardiness costs in a single machin...

1Laboratory of Algorithms and Technologies for Networks Analysis National Research University Higher School of Economics 136 Rodionova street, Niznhy Novgorod 603093, Russia 2Department of Industrial and Systems Engineering, University of Florida 303 Weil Hall, Gainesville, FL, 32611, USA 3Department of Operations Management & Operations Research, University of Groningen Nettelbosje 2, 9747 AE ...

A general formulation of the single machine scheduling problem with fuzzy parameters is proposed. Such notions as schedule, cost function and precedence relation are defined. The concept of f regular cost function is introduced and several properties of the class of problems with f -regular cost function are shown.

Some scheduling problems, including the Travelling Salesman Problem (TSP), have a “big valley” search landscape: the best solutions have common building blocks, so crossover works well. Unfortunately, in a realistic single-machine problem (TSP with batching, sequence-dependent setups, and multi-level precedence constraints) the best solutions have little in common. A mutation-only approach