Flow Shop Problems with Time Lags

descriptionPublicationkeyboard_double_arrow_right Article 01 Apr 1983 English Publisher:Institute for Operations Research and the Management Sciences (INFORMS)Journal:Management Science, volume 29, pages 477-481 (issn: 0025-1909, eissn: 1526-5501,

Copyright policy )

Authors: Wlodzimierz Szwarc;

doi: 10.1287/mnsc.29.4.477

Flow Shop Problems with Time Lags

- Summary
- Subjects
- Metrics

Abstract

This paper defines a model that covers the multimachine extensions of all existing flow-shop problems with time lags as well as flow-shop problems where setup, processing and release times are separated. Approximate solutions and lower completion time bounds are developed for the restricted and unrestricted cases.

Related Organizations

University of Wisconsin–Milwaukee
United States

Keywords

lower completion time bounds, Deterministic scheduling theory in operations research, extension of the classical flow shop problem, flow shop, queues: deterministic, mathematics: combinatorics [production/scheduling], time lags, approximate solutions

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	28
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average