This paper considers a scheduling problem in which the objective is to determine an optimal machine speed pair and an optimal schedule. There are two machines A, B and n jobs each of which consists of two operations. One operation is to be processed on machine A and the other on machine B. All jobs are open shop type, i.e., processing order of two operations is not specified and so processing o...

We consider the movement minimization problem in a conveyor flow shop processing controlled by one worker for all machines. A machine can only execute tasks if the worker is present. Each machine can serve as a buffer. The worker has to cover a certain distance to move from one machine to the other. The distance between two machines Pp and Pq is jp qj. The objective is to minimize the total dis...

In Australia, railway systems play a vital role in transporting the sugarcane crop from farms to mills. In this paper, a novel job shop approach is proposed to create a more efficient integrated harvesting and sugarcane transport scheduling system to reduce the cost of sugarcane transport. There are several benefits that can be attained by treating the train scheduling problem as a job shop pro...

This article presents a deterministic model for rough-cut cost estimation in a capacitated madeto-order environment. We assume that a firm can execute each job either at its own shop or by outsourcing it. The model calculates the unit cost of each product while taking into account the shop floor rough-cut capacity planning, and by determining what to produce in the firm’s shop and what to outso...

This paper presents and evaluates an order release decision rule in a job-shop, based on the input-output control concept. The order release mechanism is part of a global decision-making scheme that includes four main decisions: accept/reject orders, define the order’s due date, release the accepted jobs and dispatch it on the shop floor. This paper also presents an evaluation of two acceptance...

Given a job set J = f1; 2; :::; ng where each job has to be processed non preemptively on m machines M1; M2;..., Mm in that order. The processing time of job j on machine Mi is pij : At time t = 0; all jobs are available at an input device denoted by M0: After completion, each job must be taken from Mm to an output device denoted Mm+1 (for convenience, we set pm+1;j = 0;8j 2 J): The transfer be...