Logo image
A new formulation and solution of the flowshop scheduling problem with no in-process waiting
Journal article   Peer reviewed

A new formulation and solution of the flowshop scheduling problem with no in-process waiting

Willem Selen and D D Hott
Applied Mathematical Modelling, Vol.10(4), pp.246-248
1986
url
https://doi.org/10.1016/0307-904X(86)90053-3View
Published Version

Abstract

goal programming flowshop scheduling multiple criteria no in-process waiting no intermediate queues
To date, all models reported in the literature relating to the flowshop sequencing problem with no in-process waiting, have been based on single objective optimization. This paper presents a mixed integer goal programming model of the generalized N job, M machine standard flowshop problem with no in-process waiting, i.e. no intermediate queues. Instead of optimization being based on a single objective, the most satisfactory sequence is derived subject to user specified selection of the pre-emptive goals: makespan, flowtime, and machine idle time. Computational results of sample problems illustrating the advantage of a multiple criteria selection method are shown. © 1986.

Details

Metrics

2 File views/ downloads
1050 Record Views

InCites Highlights

These are selected metrics from InCites Benchmarking & Analytics tool, related to this output

Collaboration types
Domestic collaboration
International collaboration
Web Of Science research areas
Engineering, Multidisciplinary
Mathematics, Interdisciplinary Applications
Mechanics

UN Sustainable Development Goals (SDGs)

This output has contributed to the advancement of the following goals:

#12 Responsible Consumption & Production

Source: InCites

Logo image