In manufacturing control, machine scheduling research has mostly dealt with problems either without maintenance or with deterministic maintenance when no failure can occur. This can be unrealistic in practical settings. In this work, an experimental model is developed to evaluate the effect of corrective and preventive maintenance schemes on scheduling performance in the presence machine failur...

A new machine learning framework is introduced in this paper, based on Hidden Markov Model (HMM), designed to provide scheduling in dynamic wireless push systems. In realistic wireless systems, the clients’ intentions change dynamically, hence a cognitive scheduling scheme is needed to estimate the desirability of the connected clients. The proposed scheduling scheme is enhanced with selforgani...

In this paper a class of single machine scheduling problems is discussed. It is assumed that job parameters, such as processing times, due dates, or weights are uncertain and their values are specified in the form of a discrete scenario set. The Ordered Weighted Averaging (OWA) aggregation operator is used to choose an optimal schedule. The OWA operator generalizes traditional criteria in decis...

Standard scheduling theory assumes that all machines are continuously available throughout the planning horizon. In many manufacturing and service management situations however, machines need to be maintained periodically to prevent malfunctions. During the maintenance period, a machine is not available for processing jobs. Hence, a more realistic scheduling model should take into account machi...

A three layer feed forward neural network was constructed and tested to analyze the scheduling process on single machine. The operating variables studied are the operation, processing time, setup time, deadline time, duedate time, priority, machine, and fabric color. These variables were used as input to the constructed neural network in order to predict the scheduling completion time as the ou...

This paper introduces a modified shifting bottleneck approach to solve train scheduling and rescheduling problems. The problem is formulated as a job shop scheduling model and a mixed integer linear programming model is also presented. The shifting bottleneck procedure is a wellestablished heuristic method for obtaining solutions to the job shop and other machine scheduling problems. We modify ...