This paper describes a simple algorithm for the solution of very large sequence problems without the use of a computer. It produces approximate solutions to the n job, m machine sequencing problem where no passing is considered and the criterion is minimum total elapsed time. Up to m - 1...

This paper is concerned with the study of the constant due-date assignment policy in a dynamic job shop. Assuming that production times are randomly distributed, each job has a penalty cost that is some non-linear function of its due-date and its actual completion time. The due date is found by...

A decentralized system of competing retailers that order and sell the same product in a sales season is studied. When a customer demand occurs at a stocked-out retailer, that retailer requests a unit to be transshipped from another retailer who charges a transshipment price. If this request is...