Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry

Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry

0.00 Avg rating0 Votes
Article ID: iaor20021807
Country: Netherlands
Volume: 135
Issue: 1
Start Page Number: 42
End Page Number: 49
Publication Date: Nov 2001
Journal: European Journal of Operational Research
Authors: , ,
Keywords: scheduling, programming: linear
Abstract:

This paper deals with the resolution of a bicriteria scheduling problem connected with the glass bottles production. The shop is made up of unrelated parallel machines and the aim is to compute a schedule of orders that maximizes the total margin and that minimizes the difference in machines workload. An algorithm to compute the set of all strict Pareto optima is offered and later extended into an interactive algorithm.

Reviews

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