Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDS. S. Panwalkar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j19]S. S. Panwalkar, Christos Koulamas:
New results for minimising variation of flow time in two-machine proportionate no-wait flow shops. Int. J. Prod. Res. 59(9): 2789-2799 (2021)- 2020
- [j18]S. S. Panwalkar, Christos Koulamas:
Analysis of flow shop scheduling anomalies. Eur. J. Oper. Res. 280(1): 25-33 (2020) - [j17]S. S. Panwalkar, Christos Koulamas
:
Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines. J. Sched. 23(1): 145-154 (2020)
2010 – 2019
- 2019
- [j16]Christos Koulamas, S. S. Panwalkar:
The two-stage no-wait/blocking proportionate super shop scheduling problem. Int. J. Prod. Res. 57(10): 2956-2965 (2019) - [j15]S. S. Panwalkar, Christos Koulamas:
The evolution of schematic representations of flow shop scheduling problems. J. Sched. 22(4): 379-391 (2019) - 2018
- [j14]Christos Koulamas, S. S. Panwalkar:
New index priority rules for no-wait flow shops. Comput. Ind. Eng. 115: 647-652 (2018) - 2017
- [j13]S. S. Panwalkar, Christos Koulamas:
On the dominance of permutation schedules for some ordered and proportionate flow shop problems. Comput. Ind. Eng. 107: 105-108 (2017) - 2016
- [j12]Christos Koulamas, S. S. Panwalkar:
The proportionate two-machine no-wait job shop scheduling problem. Eur. J. Oper. Res. 252(1): 131-135 (2016) - 2015
- [j11]Christos Koulamas, S. S. Panwalkar:
On the equivalence of single machine earliness/tardiness problems with job rejection. Comput. Ind. Eng. 87: 1-3 (2015) - [j10]Christos Koulamas, S. S. Panwalkar:
Job selection in two-stage shops with ordered machines. Comput. Ind. Eng. 88: 350-353 (2015) - [j9]Christos Koulamas, S. S. Panwalkar:
A note on the complexity of scheduling problems with linear job deterioration. J. Glob. Optim. 62(2): 409-410 (2015) - 2014
- [j8]S. S. Panwalkar, Christos Koulamas:
The two-machine no-wait general and proportionate open shop makespan problem. Eur. J. Oper. Res. 238(2): 471-475 (2014) - 2013
- [j7]S. S. Panwalkar, Christos Koulamas:
The three-stage ordered flow shop problem with flexible stage ordering. Comput. Ind. Eng. 64(4): 1093-1095 (2013) - 2012
- [j6]S. S. Panwalkar, Christos Koulamas:
An O(n2) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines. Eur. J. Oper. Res. 221(1): 7-13 (2012)
1990 – 1999
- 1998
- [j5]Surya Danusaputro Liman, Shrikant S. Panwalkar, Sansern Thongmee:
Common due window size and location determination in a single machine scheduling problem. J. Oper. Res. Soc. 49(9): 1007-1010 (1998) - 1997
- [j4]Surya Danusaputro Liman, Shrikant S. Panwalkar, Sansern Thongmee:
A single machine scheduling problem with common due window and controllable processing times. Ann. Oper. Res. 70: 145-154 (1997) - 1992
- [j3]Richard A. Dudek, S. S. Panwalkar, M. L. Smith:
The Lessons of Flowshop Scheduling Research. Oper. Res. 40(1): 7-13 (1992)
1980 – 1989
- 1982
- [j2]S. S. Panwalkar, M. L. Smith, Avi Seidmann:
Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem. Oper. Res. 30(2): 391-399 (1982)
1970 – 1979
- 1977
- [j1]S. S. Panwalkar, Wafik Iskander:
A Survey of Scheduling Rules. Oper. Res. 25(1): 45-61 (1977)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 02:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
