The following pages link to Wlodzimierz Szwarc (Q189397):
Displaying 50 items.
- Generating improved dominance conditions for the flowshop problem (Q580164) (← links)
- The tridiagonal transportation problem (Q788634) (← links)
- Some remarks on the decomposition properties of the single machine total tardiness problem (Q856256) (← links)
- Parametric precedence relations in single machine scheduling (Q916560) (← links)
- The critical path approach in the flow-shop problem (Q1141077) (← links)
- Decomposition in single-machine scheduling (Q1273128) (← links)
- Solution of the generalized Townsend single machine scheduling model (Q1278202) (← links)
- An instant solution of the \(2\times n\) bottleneck transportation problem (Q1318660) (← links)
- Decomposition of the single machine total tardiness problem (Q1362989) (← links)
- Solution of the single machine total tardiness problem (Q1592283) (← links)
- The weighted common due date single machine scheduling problem revisited (Q1919202) (← links)
- Earliness and tardiness single machine scheduling with proportional weights (Q2564875) (← links)
- Clustered flow shop models (Q2564881) (← links)
- An approximate solution of the flow-shop problem with sequence dependent setup times (Q3035126) (← links)
- Permutation flow-shop theory revisited (Q3048554) (← links)
- Solution of the Akers-Friedman Scheduling Problem (Q3281502) (← links)
- A note on the flow-shop problem without interruptions in job processing (Q3320105) (← links)
- (Q3348705) (← links)
- On cycling in the simplex method of the transportation problem (Q3598207) (← links)
- A Transportation Type Aggregate Production Model with Backordering (Q3659506) (← links)
- Flow Shop Problems with Time Lags (Q3659509) (← links)
- Solvable cases of the flow-shop problem without interruptions in job processing (Q3670908) (← links)
- The Caterer Problem (Q3694982) (← links)
- Transshipment along a single road (Q3701195) (← links)
- The flow shop problem with time lags and separated setup times (Q3734157) (← links)
- The clustered flow-shop problem (Q3798472) (← links)
- A flow-shop problem with sequence-dependent additive setup times (Q3806968) (← links)
- The Single Machine Problem with a Quadratic Cost Function of Completion Times (Q3815117) (← links)
- Single-machine scheduling to minimize absolute deviation of completion times from a common due date (Q3829339) (← links)
- Extreme solutions of the two machine flow-shop problem (Q3901286) (← links)
- Technical Note—Precedence Relations of the Flow-Shop Problem (Q3929528) (← links)
- (Q4032003) (← links)
- A note on mathematical aspects of the 3 ×n job-shop sequencing problem (Q4047394) (← links)
- Letter to the Editor—Remarks (Q4068428) (← links)
- Instant transportation solutions (Q4077050) (← links)
- (Q4096092) (← links)
- (Q4096727) (← links)
- (Q4128261) (← links)
- Special cases of the flow-shop problem (Q4156113) (← links)
- Johnson's approximate method for the 3 ×n job shop problem (Q4158782) (← links)
- Optimal Two-Machine Orderings in the 3 × <i>n</i> Flow-Shop Problem (Q4158783) (← links)
- Technical Note—Dominance Conditions for the Three-Machine Flow-Shop Problem (Q4158784) (← links)
- Weighted Tardiness Single Machine Scheduling with Proportional Weights (Q4274646) (← links)
- Some remarks on the time transportation problem (Q4404662) (← links)
- Mathematical aspects of the 3 × n job-shop sequencing problem (Q4775690) (← links)
- Minimizing a Quadratic Cost Function of Waiting Times in Single-Machine Scheduling (Q4849293) (← links)
- Optimal timing schedules in earliness-tardiness single machine sequencing (Q4859570) (← links)
- Minimizing the weighted sum of quadratic completion times on a single machine (Q4859582) (← links)
- Optimal Elimination Methods in the <i>m</i> × <i>n</i> Flow-Shop Scheduling Problem (Q5183257) (← links)
- Letter to the Editor—The Initial Solution of the Transportation Problem (Q5332965) (← links)
