George J. Kyparisis
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
George J. Kyparisis has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Christos Koulamas
Department of Information Systems and Business Analytics, Florida International University, Miami, FL 33199, USA
7 shared publications Christos Koulamas
Department of Information Systems and Business Analytics, Florida International University, Miami, USA
6 shared publications- Guohua Wan
Shanghai Jiao Tong University
1 shared publication - Michael L. Pinedo
New York University
1 shared publication - Sushil Gupta
Florida International University, Miami, Florida, USA
1 shared publication
Latest Publications
- 1 July 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 72 (4) , 1749-1750
Erratum to “Competitive Two-Agent Scheduling and Its Applications”
Erratum to “Competitive Two-Agent Scheduling and Its Applications” The paper “Competitive Two-Agent Scheduling and Its Applications” by Leung, Pinedo, and Wan appeared in Operations Research in 2010. Because competitive agent scheduling has become an active area of research, the paper has garnered its share of citations over the years. This particular direction of scheduling research has become so popular that the book Multiagent Scheduling: Models and Algorithms by Agnetis, Billaut, Gawiejnowicz, Pacciarelli, and Soukhal appeared in 2014. However, one of the results in the Leung et al. paper had a minor error in it. The paper considers a two-agent scheduling problem with a single machine, with each one of the two agents having their own set of jobs. The first agent has as the objective the minimization of the total tardiness of her set of jobs, and the second agent has to ensure that the total completion time of her set of jobs is less than or equal to Q. Leung et al. showed, through a dynamic programming formulation, that this problem can be solved in pseudopolynomial time and determined the time complexity of their algorithm. Their proof contains a minor error. The proper algorithm is still pseudopolynomial but of a slightly higher time complexity.
- 1 July 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 72 (4) , 1749-1750
Erratum to “Competitive Two-Agent Scheduling and Its Applications”
Erratum to “Competitive Two-Agent Scheduling and Its Applications” The paper “Competitive Two-Agent Scheduling and Its Applications” by Leung, Pinedo, and Wan appeared in Operations Research in 2010. Because competitive agent scheduling has become an active area of research, the paper has garnered its share of citations over the years. This particular direction of scheduling research has become so popular that the book Multiagent Scheduling: Models and Algorithms by Agnetis, Billaut, Gawiejnowicz, Pacciarelli, and Soukhal appeared in 2014. However, one of the results in the Leung et al. paper had a minor error in it. The paper considers a two-agent scheduling problem with a single machine, with each one of the two agents having their own set of jobs. The first agent has as the objective the minimization of the total tardiness of her set of jobs, and the second agent has to ensure that the total completion time of her set of jobs is less than or equal to Q. Leung et al. showed, through a dynamic programming formulation, that this problem can be solved in pseudopolynomial time and determined the time complexity of their algorithm. Their proof contains a minor error. The proper algorithm is still pseudopolynomial but of a slightly higher time complexity.
- 2 November 2022
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 74 (11) , 2289-2299
Simultaneous minimisation of mean and variation of waiting times in a two-stage proportionate blocking flow shop
We consider the two-stage proportionate blocking flow shop scheduling problem with the objective of simultaneously minimising the mean and the variation of job waiting times. We show that the problem can be solved in time by evaluating at most two candidate optimal sequences. In some cases, the shortest processing time (SPT) sequence is optimal for any set of processing times. In all other cases, the optimal sequence is either the SPT sequence or a V-shaped sequence. We show that the optimal solution value for the corresponding no-wait flow shop scheduling problem is no worse than the optimal solution value for the blocking flow shop problem. We then analyse the blocking flow shop problem with the option of rejecting jobs from the sequence by paying their job-specific rejection penalties. We show that the problem with the job rejection option can be solved in time by dynamic programming (DP). Finally, we show that our results also apply to the corresponding flow shop scheduling problem with synchronous job transfers.- 2 November 2022
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 74 (11) , 2289-2299
Simultaneous minimisation of mean and variation of waiting times in a two-stage proportionate blocking flow shop
We consider the two-stage proportionate blocking flow shop scheduling problem with the objective of simultaneously minimising the mean and the variation of job waiting times. We show that the problem can be solved in time by evaluating at most two candidate optimal sequences. In some cases, the shortest processing time (SPT) sequence is optimal for any set of processing times. In all other cases, the optimal sequence is either the SPT sequence or a V-shaped sequence. We show that the optimal solution value for the corresponding no-wait flow shop scheduling problem is no worse than the optimal solution value for the blocking flow shop problem. We then analyse the blocking flow shop problem with the option of rejecting jobs from the sequence by paying their job-specific rejection penalties. We show that the problem with the job rejection option can be solved in time by dynamic programming (DP). Finally, we show that our results also apply to the corresponding flow shop scheduling problem with synchronous job transfers.- 26 November 2021
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 163, 107835
Flow shop scheduling with two distinct job due dates
- 26 November 2021
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 163, 107835
Flow shop scheduling with two distinct job due dates
- 1 July 2018
- Published by Elsevier in Operations Research Letters
- Vol. 46 (4) , 373-378
Resale price maintenance in supply chains with general multiplicative demand
- 1 July 2018
- Published by Elsevier in Operations Research Letters
- Vol. 46 (4) , 373-378
Resale price maintenance in supply chains with general multiplicative demand
- 2 September 2017
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 56 (17) , 5854-5865
Competition in two-tier serial and assembly supply chains with general consumer utility functions
We consider two-tier serial supply chains with multiple entrants at each tier and investigate the existence of an equilibrium under a general consumer utility function corresponding to a general inverse price-demand function. In the case of a polynomial inverse price-demand function, we obtain closed-form expressions for the equilibrium prices, the production quantities and the profits of the supply chain entrants. We conclude that the quantity of finished goods supplied to the market, the maximum total operating profit accrued by all supply chain entrants, and the elasticity of the (imputed) demand are all sensitive to the elasticity of slope of the polynomial inverse price-demand function. We then extend our analysis to two-tier assembly supply chains and conclude that most of our results extend to them as well.
- 2 September 2017
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 56 (17) , 5854-5865
Competition in two-tier serial and assembly supply chains with general consumer utility functions
We consider two-tier serial supply chains with multiple entrants at each tier and investigate the existence of an equilibrium under a general consumer utility function corresponding to a general inverse price-demand function. In the case of a polynomial inverse price-demand function, we obtain closed-form expressions for the equilibrium prices, the production quantities and the profits of the supply chain entrants. We conclude that the quantity of finished goods supplied to the market, the maximum total operating profit accrued by all supply chain entrants, and the elasticity of the (imputed) demand are all sensitive to the elasticity of slope of the polynomial inverse price-demand function. We then extend our analysis to two-tier assembly supply chains and conclude that most of our results extend to them as well.
- 1 August 2016
- Published by SAGE Publications in Production and Operations Management
- Vol. 25 (8) , 1404-1414
Assembly Systems with Sequential Supplier Decisions and Uncertain Demand
We consider multitier push assembly systems with sequential supplier decisions and a wholesale price contract. We show that both an Original Equipment Manufacturer (OEM)–Contract Manufacturer (CM) assembly and a modular assembly with sequential supplier decisions are mathematically equivalent to the corresponding traditional assembly. We determine that, in most cases, the first mover supplier realizes a higher profit than the second mover supplier but we also identify the sufficient conditions for the reverse to occur. We provide conditions under which the order quantity, the second mover profit, total supplier profits, and the assembler profit are either higher or lower for a multitier system with sequential suppliers compared to simultaneous suppliers. We conclude that the first mover is always better off in a three‐tier sequential system while she can be either better off or worse off in a four‐tier sequential system compared to the corresponding simultaneous systems. We also analyze the impact of information asymmetry on the supplier and assembler profits in a three‐tier sequential system. Finally, we determine the profit threshold for an independent manufacturer in a three‐tier system to become a CM in a four‐tier system and vice versa.
- 1 August 2016
- Published by SAGE Publications in Production and Operations Management
- Vol. 25 (8) , 1404-1414
Assembly Systems with Sequential Supplier Decisions and Uncertain Demand
We consider multitier push assembly systems with sequential supplier decisions and a wholesale price contract. We show that both an Original Equipment Manufacturer (OEM)–Contract Manufacturer (CM) assembly and a modular assembly with sequential supplier decisions are mathematically equivalent to the corresponding traditional assembly. We determine that, in most cases, the first mover supplier realizes a higher profit than the second mover supplier but we also identify the sufficient conditions for the reverse to occur. We provide conditions under which the order quantity, the second mover profit, total supplier profits, and the assembler profit are either higher or lower for a multitier system with sequential suppliers compared to simultaneous suppliers. We conclude that the first mover is always better off in a three‐tier sequential system while she can be either better off or worse off in a four‐tier sequential system compared to the corresponding simultaneous systems. We also analyze the impact of information asymmetry on the supplier and assembler profits in a three‐tier sequential system. Finally, we determine the profit threshold for an independent manufacturer in a three‐tier system to become a CM in a four‐tier system and vice versa.
- 1 September 2013
- Published by Elsevier in Operations Research Letters
- Vol. 41 (5) , 540-544
Two-tier equilibria for supply chains with a single manufacturer and multiple asymmetric retailers
- 1 September 2013
- Published by Elsevier in Operations Research Letters
- Vol. 41 (5) , 540-544
Two-tier equilibria for supply chains with a single manufacturer and multiple asymmetric retailers
- 1 September 2013
- Published by Elsevier in Operations Research Letters
- Vol. 41 (5) , 445-448
On index priority sequencing rules for scheduling with time-dependent job processing times
- 1 September 2013
- Published by Elsevier in Operations Research Letters
- Vol. 41 (5) , 445-448
On index priority sequencing rules for scheduling with time-dependent job processing times
- 1 November 2009
- Published by SAGE Publications in Production and Operations Management
- Vol. 18 (6) , 604-620
E‐Business: A Review of Research Published in Production and Operations Management (1992–2008)
We review, classify, consolidate, and synthesize the contributions to the expanding field of e‐business that have been published in Production and Operations Management. We classify e‐business research in the following four categories: (1) e‐auctions, (2) radio frequency identification, (3) e‐business system design, and (4) competition, conflict, collaboration, and coordination (C4 in e‐business). We identify important research themes, research methodologies, and research techniques within each of these categories. We also provide directions for future research and discuss the managerial implications of the e‐business research reported in our paper.
- 1 November 2009
- Published by SAGE Publications in Production and Operations Management
- Vol. 18 (6) , 604-620
E‐Business: A Review of Research Published in Production and Operations Management (1992–2008)
We review, classify, consolidate, and synthesize the contributions to the expanding field of e‐business that have been published in Production and Operations Management. We classify e‐business research in the following four categories: (1) e‐auctions, (2) radio frequency identification, (3) e‐business system design, and (4) competition, conflict, collaboration, and coordination (C4 in e‐business). We identify important research themes, research methodologies, and research techniques within each of these categories. We also provide directions for future research and discuss the managerial implications of the e‐business research reported in our paper.
- 3 May 2006
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 53 (6) , 568-575
A heuristic for maximizing the number of on‐time jobs on two uniform parallel machines
- 3 May 2006
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 53 (6) , 568-575
A heuristic for maximizing the number of on‐time jobs on two uniform parallel machines