default search action
George J. Kyparisis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j42]Christos Koulamas
, George J. Kyparisis
Erratum to "Competitive Two-Agent Scheduling and Its Applications". Oper. Res. 72(4): 1749-1750 (2024) - 2023
- [j41]Christos Koulamas, George J. Kyparisis
Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection. Eur. J. Oper. Res. 305(2): 608-616 (2023) - [j40]Christos Koulamas, George J. Kyparisis
A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems. Eur. J. Oper. Res. 305(3): 999-1017 (2023) - [j39]Christos Koulamas, George J. Kyparisis
Simultaneous minimisation of mean and variation of waiting times in a two-stage proportionate blocking flow shop. J. Oper. Res. Soc. 74(11): 2289-2299 (2023) - 2022
- [j38]Christos Koulamas, George J. Kyparisis
Flow shop scheduling with two distinct job due dates. Comput. Ind. Eng. 163: 107835 (2022) - 2021
- [j37]Christos Koulamas, George J. Kyparisis
The no-wait flow shop with rejection. Int. J. Prod. Res. 59(6): 1852-1859 (2021)
2010 – 2019
- 2019
- [j36]Christos Koulamas, George J. Kyparisis
New results for single-machine scheduling with past-sequence-dependent setup times and due date-related objectives. Eur. J. Oper. Res. 278(1): 149-159 (2019) - 2018
- [j35]George J. Kyparisis
The price-setting newsvendor problem with nonnegative linear additive demand. Eur. J. Oper. Res. 269(2): 695-698 (2018) - [j34]George J. Kyparisis
Competition in two-tier serial and assembly supply chains with general consumer utility functions. Int. J. Prod. Res. 56(17): 5854-5865 (2018) - [j33]George J. Kyparisis
The price-setting newsvendor with nonlinear salvage revenue and shortage cost. Oper. Res. Lett. 46(1): 64-68 (2018) - [j32]George J. Kyparisis
Resale price maintenance in supply chains with general multiplicative demand. Oper. Res. Lett. 46(4): 373-378 (2018) - 2016
- [j31]George J. Kyparisis
New structural properties of supply chains with price-only contracts. Oper. Res. Lett. 44(6): 831-834 (2016) - 2015
- [j30]Christos Koulamas, George J. Kyparisis
The three-machine proportionate open shop and mixed shop minimum makespan problems. Eur. J. Oper. Res. 243(1): 70-74 (2015) - 2013
- [j29]George J. Kyparisis
On index priority sequencing rules for scheduling with time-dependent job processing times. Oper. Res. Lett. 41(5): 445-448 (2013) - [j28]George J. Kyparisis
Two-tier equilibria for supply chains with a single manufacturer and multiple asymmetric retailers. Oper. Res. Lett. 41(5): 540-544 (2013) - 2011
- [j27]George J. Kyparisis
A note on the classification of consumer demand functions with respect to retailer pass-through rates. Eur. J. Oper. Res. 211(1): 213-215 (2011) - [j26]George J. Kyparisis
A note on equilibria for two-tier supply chains with a single manufacturer and multiple retailers. Oper. Res. Lett. 39(6): 471-474 (2011) - 2010
- [j25]Christos Koulamas, George J. Kyparisis
A note on the effects of downstream efficiency on upstream pricing. Eur. J. Oper. Res. 200(3): 926-928 (2010) - [j24]Christos Koulamas, Sushil Gupta, George J. Kyparisis
A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times. Eur. J. Oper. Res. 205(2): 479-482 (2010)
2000 – 2009
- 2009
- [j23]Christos Koulamas, George J. Kyparisis
A note on the proportionate flow shop with a bottleneck machine. Eur. J. Oper. Res. 193(2): 644-645 (2009) - [j22]Christos Koulamas, George J. Kyparisis
A modified LPT algorithm for the two uniform parallel machine makespan minimization problem. Eur. J. Oper. Res. 196(1): 61-68 (2009) - [r2]George J. Kyparisis
Sensitivity Analysis of Complementarity Problems. Encyclopedia of Optimization 2009: 3445-3447 - [r1]George J. Kyparisis
Sensitivity Analysis of Variational Inequality Problems. Encyclopedia of Optimization 2009: 3447-3450 - 2008
- [j21]Christos Koulamas, George J. Kyparisis
An improved delayed-start LPT algorithm for a partition problem on two identical parallel machines. Eur. J. Oper. Res. 187(2): 660-666 (2008) - [j20]Christos Koulamas, George J. Kyparisis
Single-machine scheduling problems with past-sequence-dependent setup times. Eur. J. Oper. Res. 187(3): 1045-1049 (2008) - [j19]Christos Koulamas, George J. Kyparisis
Single-machine scheduling with waiting-time-dependent due dates. Eur. J. Oper. Res. 191(2): 577-581 (2008) - 2007
- [j18]Christos Koulamas, George J. Kyparisis
Single-machine and two-machine flowshop scheduling with general learning functions. Eur. J. Oper. Res. 178(2): 402-407 (2007) - [j17]Christos Koulamas, George J. Kyparisis
A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines. Eur. J. Oper. Res. 182(2): 945-951 (2007) - 2006
- [j16]George J. Kyparisis
Flexible flow shop scheduling with uniform parallel machines. Eur. J. Oper. Res. 168(3): 985-997 (2006) - [j15]Jatinder N. D. Gupta
Performance guarantees for flowshop heuristics to minimize makespan. Eur. J. Oper. Res. 169(3): 865-872 (2006) - [j14]George J. Kyparisis
A note on makespan minimization in two-stage flexible flow shops with uniform machines. Eur. J. Oper. Res. 175(2): 1321-1327 (2006) - 2005
- [j13]Christos Koulamas, George J. Kyparisis
A correction to "Single machine scheduling with release times, deadlines and tardiness objectives" [EJOR 133 (2001) 447-453]. Eur. J. Oper. Res. 160(2): 574-575 (2005) - 2004
- [j12]Jatinder N. D. Gupta
Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan. Ann. Oper. Res. 129(1-4): 171-185 (2004) - [j11]Christos Koulamas, George J. Kyparisis
Concurrent flowshop scheduling to minimize makespan. Eur. J. Oper. Res. 156(2): 524-529 (2004) - [j10]Christos Koulamas, George J. Kyparisis
Makespan minimization on uniform parallel machines with release times. Eur. J. Oper. Res. 157(1): 262-266 (2004) - 2002
- [j9]George J. Kyparisis
Assembly-Line Scheduling with Concurrent Operations and Parallel Machines. INFORMS J. Comput. 14(1): 68-80 (2002) - 2001
- [j8]Christos Koulamas, George J. Kyparisis
The three-stage assembly flowshop scheduling problem. Comput. Oper. Res. 28(7): 689-704 (2001) - [j7]Christos Koulamas, George J. Kyparisis
A note on scheduling flowshops with flexible stage ordering. Eur. J. Oper. Res. 129(1): 224-229 (2001) - [j6]Christos Koulamas, George J. Kyparisis
Single machine scheduling with release times, deadlines and tardiness objectives. Eur. J. Oper. Res. 133(2): 447-453 (2001) - [j5]George J. Kyparisis
A note on weighted completion time minimization in a flexible flow shop. Oper. Res. Lett. 29(1): 5-11 (2001) - 2000
- [j4]George J. Kyparisis
Open shop scheduling with makespan and total completion time criteria. Comput. Oper. Res. 27(1): 15-27 (2000) - [j3]George J. Kyparisis
Flow shop and open shop scheduling with a critical machine and two operations per job. Eur. J. Oper. Res. 127(1): 120-125 (2000) - [j2]Christos Koulamas, George J. Kyparisis
Scheduling on uniform parallel machines to minimize maximum lateness. Oper. Res. Lett. 26(4): 175-179 (2000)
1990 – 1999
- 1997
- [j1]George J. Kyparisis
Open Shop Scheduling with Maximal Machines. Discret. Appl. Math. 78(1-3): 175-187 (1997)
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-11-13 23:52 CET 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: