A stationary cyclical production scheduling problem under a nonadditive output function

A stationary cyclical production scheduling problem under a nonadditive output function

0.00 Avg rating—0 Votes
Article ID: iaor1995474
Country: Switzerland
Volume: 22
Issue: 3
Start Page Number: 203
End Page Number: 212
Publication Date: Feb 1994
Journal: Engineering Optimization
Authors: , ,
Keywords: scheduling, programming: nonlinear, programming: integer, programming: branch and bound
Abstract:

The purpose of this paper is to formulate and solve a nonlinear mixed zero-one integer programming problem aimed to maximize total output by scheduling the operational time of N non-identical machines. Properties of the optimal solution are identified under restrictions imposed on machine availability and various budget constraints. A branch and bound algorithm to solve the problem is suggested.

Reviews

Required fields are marked *. Your email address will not be published.