PERMUTATION FLOW-SHOP THEORY REVISITEDSZWARC W.1978; NAV. RES. LOGIST. QUART.; USA; DA. 1978; VOL. 25; NO 3; PP. 557-570; BIBL. 16 REF.Article

THE TRANSPORTATION PARADOXSZWARC W.1971; NAV. RES. LOGIST. QUART.; U.S.A.; DA. 1971; VOL. 18; NO 2; PP. 185-202; BIBL. 5 REF.Serial Issue

EXTREME SOLUTIONS OF THE TWO MACHINE FLOW-SHOP PROBLEMSZWARC W.1981; NAV. RES. LOGIST. Q.; ISSN 0028-1441; USA; DA. 1981; VOL. 28; NO 1; PP. 103-114; BIBL. 4 REF.Article

A NOTE ON MATHEMATICAL ASPECTS OF THE 3 X N JOB-SHOP SEQUENCING PROBLEM.SZWARC W.1974; NAV. RES. LOGIST. QUART.; U.S.A.; DA. 1974; VOL. 21; NO 4; PP. 725-726; BIBL. 1 REF.Article

SOME REMARKS ON THE TIME TRANSPORTATION PROBLEMSZWARC W.1972; NAV. RES. LOGIST. QUART.; U.S.A.; DA. 1972; VOL. 18; NO 4; PP. 473-485; BIBL. 11 REF.Serial Issue

THE DYNAMIC TRANSPORTATION PROBLEMSZWARC W.1971; MATHEMATICA; ROUMAN.; DA. 1971; VOL. 13; NO 2; PP. 335-345; BIBL. 2 REF.Serial Issue

A NOTE ON THE FLOW-SHOP PROBLEM WITHOUT INTERRUPTIONS IN JOB PROCESSINGSZWARC W.1981; NAV. RES. LOGIST. Q.; ISSN 0028-1441; USA; DA. 1981; VOL. 28; NO 4; PP. 665-669; BIBL. 6 REF.Article

DOMINANCE CONDITIONS FOR THE THREE-MACHINE FLOW-SHOP PROBLEMSZWARC W.1978; OPER. RES.; USA; DA. 1978; VOL. 26; NO 1; PP. 203-206; BIBL. 5 REF.Article

SPECIAL CASES OF THE FLOW-SHOP PROBLEM.SZWARC W.1977; NAV. RES. LOGIST. QUART.; U.S.A.; DA. 1977; VOL. 24; NO 3; PP. 483-492; BIBL. 5 REF.Article

Adjacent orderings in single-machine scheduling with earliness and tardiness penaltiesSZWARC, W.Naval research logistics. 1993, Vol 40, Num 2, pp 229-243, issn 0894-069XArticle

Parametric precedence relations in single machine schedulingSZWARC, W.Operations research letters. 1990, Vol 9, Num 2, pp 133-140, issn 0167-6377, 8 p.Article

An instant solution of the 2×n bottleneck transportation problemSZWARC, W.Operations research letters. 1993, Vol 14, Num 5, pp 261-264, issn 0167-6377Article

Single-machine scheduling to minimize absolute deviation of completion times from a common due dateSZWARC, W.Naval research logistics. 1989, Vol 36, Num 5, pp 663-673, issn 0894-069X, 11 p.Article

The clustered flow-shop problemSZWARC, W.Zeitschrift für Operations Research. 1988, Vol 32, Num 5, pp 315-322, issn 0373-790XArticle

The flow shop problem with time lags and separated setup timesSZWARC, W.Zeitschrift für Operations Research. 1986, Vol 30, Num 2, pp B15-B22, issn 0373-790XArticle

Transshipment along a single roadPOSNER, M. E; SZWARC, W.Naval research logistics quarterly. 1985, Vol 32, Num 3, pp 363-372, issn 0028-1441Article

Minimizing a quadratic cost function of waiting times in single-machine schedulingSZWARC, W; MUKHOPADHYAY, S. K.The Journal of the Operational Research Society. 1995, Vol 46, Num 6, pp 753-761, issn 0160-5682Article

Optimal timing schedules in earliness-tardiness single machine sequencingSZWARC, W; MUKHOPADHYAY, S. K.Naval research logistics. 1995, Vol 42, Num 7, pp 1109-1114, issn 0894-069XArticle

Weighted tardiness single machine scheduling with proportional weightsSZWARC, W; LIU, J. J.Management science. 1993, Vol 39, Num 5, pp 626-632, issn 0025-1909Article

Decomposition of the single machine total tardiness problemSZWARC, W; MUKHOPADHYAY, S. K.Operations research letters. 1996, Vol 19, Num 5, pp 243-250, issn 0167-6377Article

The Caterer problemSZWARC, W; POSNER, M. E.Operations research. 1985, Vol 33, Num 6, pp 1215-1224, issn 0030-364XArticle

Generating improved dominance conditions for the flowshop problemGUPTA, J. N. D; SHANTHIKUMAR, J. G; SZWARC, W et al.Computers & operations research. 1987, Vol 14, Num 1, pp 41-45, issn 0305-0548Article