S. S. Panwalkar

According to our database, S. S. Panwalkar authored at least 19 papers between 1977 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2021

New results for minimising variation of flow time in two-machine proportionate no-wait flow shops.

S. S. Panwalkar, Christos Koulamas

Int. J. Prod. Res., 2021

2020

Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines.

S. S. Panwalkar, Christos Koulamas

J. Sched., 2020

Analysis of flow shop scheduling anomalies.

S. S. Panwalkar, Christos Koulamas

Eur. J. Oper. Res., 2020

2019

The evolution of schematic representations of flow shop scheduling problems.

S. S. Panwalkar, Christos Koulamas

J. Sched., 2019

The two-stage no-wait/blocking proportionate super shop scheduling problem.

Christos Koulamas, S. S. Panwalkar

Int. J. Prod. Res., 2019

2018

New index priority rules for no-wait flow shops.

Christos Koulamas, S. S. Panwalkar

Comput. Ind. Eng., 2018

2017

On the dominance of permutation schedules for some ordered and proportionate flow shop problems.

S. S. Panwalkar, Christos Koulamas

Comput. Ind. Eng., 2017

2016

The proportionate two-machine no-wait job shop scheduling problem.

Christos Koulamas, S. S. Panwalkar

Eur. J. Oper. Res., 2016

2015

A note on the complexity of scheduling problems with linear job deterioration.

Christos Koulamas, S. S. Panwalkar

J. Glob. Optim., 2015

Job selection in two-stage shops with ordered machines.

Christos Koulamas, S. S. Panwalkar

Comput. Ind. Eng., 2015

On the equivalence of single machine earliness/tardiness problems with job rejection.

Christos Koulamas, S. S. Panwalkar

Comput. Ind. Eng., 2015

2014

The two-machine no-wait general and proportionate open shop makespan problem.

S. S. Panwalkar, Christos Koulamas

Eur. J. Oper. Res., 2014

2013

The three-stage ordered flow shop problem with flexible stage ordering.

S. S. Panwalkar, Christos Koulamas

Comput. Ind. Eng., 2013

2012

An O(n²) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines.

S. S. Panwalkar, Christos Koulamas

Eur. J. Oper. Res., 2012

1998

Common due window size and location determination in a single machine scheduling problem.

Surya Danusaputro Liman, Shrikant S. Panwalkar, Sansern Thongmee

J. Oper. Res. Soc., 1998

1997

A single machine scheduling problem with common due window and controllable processing times.

Surya Danusaputro Liman, Shrikant S. Panwalkar, Sansern Thongmee

Ann. Oper. Res., 1997

1992

The Lessons of Flowshop Scheduling Research.

Richard A. Dudek, S. S. Panwalkar, M. L. Smith

Oper. Res., 1992

1982

Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem.

S. S. Panwalkar, M. L. Smith, Avi Seidmann

Oper. Res., 1982

1977

A Survey of Scheduling Rules.

S. S. Panwalkar, Wafik Iskander

Oper. Res., 1977