default search action
George Steiner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j57]Christos Koulamas
, George Steiner:
New results for scheduling to minimize tardiness on one machine with rejection and related problems. J. Sched. 24(1): 27-34 (2021)
2010 – 2019
- 2017
- [j56]Daniel Oron
Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times. Eur. J. Oper. Res. 256(2): 384-391 (2017) - 2015
- [j55]Dvir Shabtay
A pseudo-polynomial time algorithm for solving the resource dependent assignment problem. Discret. Appl. Math. 182: 115-121 (2015) - [j54]Daniel Oron
Single machine scheduling with two competing agents and equal job processing times. Eur. J. Oper. Res. 244(1): 86-99 (2015) - [j53]Sorina Dumitrescu, George Steiner, Rui Zhang:
Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs. J. Sched. 18(1): 3-13 (2015) - 2014
- [j52]Xianyu Yu, Yulin Zhang, George Steiner:
Single-machine scheduling with periodic maintenance to minimize makespan revisited. J. Sched. 17(3): 263-270 (2014) - 2013
- [j51]Jianbo Qian, George Steiner:
Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine. Eur. J. Oper. Res. 225(3): 547-551 (2013) - [j50]Esaignani Selvarajah, George Steiner, Rui Zhang:
Single machine batch scheduling with release times and delivery costs. J. Sched. 16(1): 69-79 (2013) - 2011
- [j49]George Steiner, Rui Zhang:
Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries. Ann. Oper. Res. 191(1): 171-181 (2011) - [j48]Vladimir G. Deineko, Dvir Shabtay
On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices. J. Heuristics 17(1): 61-96 (2011) - [j47]George Steiner, Rui Zhang:
Revised Delivery-Time Quotation in Scheduling with Tardiness Penalties. Oper. Res. 59(6): 1504-1511 (2011) - [j46]Dvir Shabtay
A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates. J. Sched. 14(5): 455-469 (2011) - 2010
- [j45]Dvir Shabtay
Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments. Discret. Appl. Math. 158(10): 1090-1103 (2010) - [j44]Moshe Dror, George Steiner:
'Strong'-'weak' precedence in scheduling: Extensions to series-parallel orders. Discret. Appl. Math. 158(16): 1767-1776 (2010) - [j43]Yaron Leyvand, Dvir Shabtay
A unified approach for scheduling with convex resource consumption functions using positional penalties. Eur. J. Oper. Res. 206(2): 301-312 (2010) - [j42]Yaron Leyvand, Dvir Shabtay
Just-in-time scheduling with controllable processing times on parallel machines. J. Comb. Optim. 19(3): 347-368 (2010)
2000 – 2009
- 2009
- [j41]Daniel Oron, George Steiner, Vadim G. Timkovsky:
The bipartite margin shop and maximum red matchings free of blue-red alternating cycles. Discret. Optim. 6(3): 299-309 (2009) - [j40]Esaignani Selvarajah, George Steiner:
Approximation Algorithms for the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs. Oper. Res. 57(2): 426-438 (2009) - [j39]George Steiner, Rui Zhang:
Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains. J. Sched. 12(6): 565-574 (2009) - 2008
- [j38]Dvir Shabtay
The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times. Ann. Oper. Res. 159(1): 25-40 (2008) - [j37]Dvir Shabtay
Optimal due date assignment in multi-machine scheduling environments. J. Sched. 11(3): 217-228 (2008) - 2007
- [j36]Stavros G. Kolliopoulos, George Steiner:
Partially ordered knapsack and applications to scheduling. Discret. Appl. Math. 155(8): 889-897 (2007) - [j35]Dvir Shabtay
A survey of scheduling with controllable processing times. Discret. Appl. Math. 155(13): 1643-1666 (2007) - [j34]George Steiner, Paul Stephenson:
Pareto optima for total weighted completion time and maximum lateness on a single machine. Discret. Appl. Math. 155(17): 2341-2354 (2007) - [j33]Dvir Shabtay
Optimal Due Date Assignment and Resource Allocation to Minimize the Weighted Number of Tardy Jobs on a Single Machine. Manuf. Serv. Oper. Manag. 9(3): 332-350 (2007) - [j32]Stavros G. Kolliopoulos, George Steiner:
Approximation algorithms for scheduling problems with a modified total weighted tardiness objective. Oper. Res. Lett. 35(5): 685-692 (2007) - [j31]Dvir Shabtay, George Steiner:
Single machine batch scheduling to minimize total completion time and resource consumption costs. J. Sched. 10(4-5): 255-261 (2007) - 2006
- [j30]Jianping Li, George Steiner:
Partioning A Bipartite Graph into Vertex-Disjoint Paths. Ars Comb. 81 (2006) - [j29]Esaignani Selvarajah, George Steiner:
Batch scheduling in a two-level supply chain - a focus on the supplier. Eur. J. Oper. Res. 173(1): 226-240 (2006) - [j28]Dvir Shabtay
Two due date assignment problems in scheduling a single machine. Oper. Res. Lett. 34(6): 683-691 (2006) - [j27]George Steiner, Zhihui Xue:
On the connection between a cyclic job shop and a reentrant flow shop scheduling problem. J. Sched. 9(4): 381-387 (2006) - [j26]Stavros G. Kolliopoulos, George Steiner:
Approximation algorithms for minimizing the total weighted tardiness on a single machine. Theor. Comput. Sci. 355(3): 261-273 (2006) - 2005
- [j25]George Steiner, Zhihui Xue:
The maximum traveling salesman problem on van der Veen matrices. Discret. Appl. Math. 146(1): 1-2 (2005) - [j24]Vladimir G. Deineko, George Steiner, Zhihui Xue:
Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices. J. Comb. Optim. 9(4): 381-399 (2005) - [j23]George Steiner, Zhihui Xue:
Scheduling in Reentrant Robotic Cells: Algorithms and Complexity. J. Sched. 8(1): 25-48 (2005) - 2004
- [c2]Stavros G. Kolliopoulos, George Steiner:
On Minimizing the Total Weighted Tardiness on a Single Machine. STACS 2004: 176-186 - 2003
- [j22]George Steiner:
On the k-path partition of graphs. Theor. Comput. Sci. 290(3): 2147-2155 (2003) - 2002
- [c1]Stavros G. Kolliopoulos, George Steiner:
Partially-Ordered Knapsack and Applications to Scheduling. ESA 2002: 612-624 - 2001
- [j21]Michel Habib
Efficient algorithms on distributive lattices. Discret. Appl. Math. 110(2-3): 169-187 (2001) - [j20]Jinliang Cheng, George Steiner, Paul Stephenson:
A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times. Eur. J. Oper. Res. 130(3): 559-575 (2001) - 2000
- [j19]George Steiner, Paul Stephenson:
Subset-Restricted Interchange for Dynamic Min-Max Scheduling Problems. SIAM J. Discret. Math. 13(4): 419-435 (2000)
1990 – 1999
- 1997
- [j18]Wieslaw Kubiak, George Steiner, Julian Scott Yeomans:
Optimal level schedules for mixed-model, multi-level just-in-time assembly systems. Ann. Oper. Res. 69: 241-259 (1997) - [j17]George Steiner:
A poset-based method for counting partitions and Ferrers diagrams. Ars Comb. 47 (1997) - [j16]George Steiner:
Minimizing the Number of Tardy Jobs with Precedence Constraints and Agreeable Due Dates. Discret. Appl. Math. 72(1-2): 167-177 (1997) - [j15]Jitender S. Deogun, Dieter Kratsch, George Steiner:
1-Tough cocomparability graphs are hamiltonian. Discret. Math. 170(1-3): 99-106 (1997) - [j14]Jitender S. Deogun, Dieter Kratsch, George Steiner:
An Approximation Algorithm for Clustering Graphs with Dominating Diametral Path. Inf. Process. Lett. 61(3): 121-127 (1997) - [j13]Michel Habib
Gray Codes for the Ideals of Interval Orders. J. Algorithms 25(1): 52-66 (1997) - [j12]Jiang Chen, George Steiner:
Approximation methods for discrete lot streaming in flow shops. Oper. Res. Lett. 21(3): 139-145 (1997) - 1996
- [j11]George Steiner:
The recognition of indifference digraphs and generalized semiorders. J. Graph Theory 21(2): 235-241 (1996) - 1994
- [j10]Jitender S. Deogun, George Steiner:
Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs. SIAM J. Comput. 23(3): 520-552 (1994) - 1993
- [j9]George Steiner, Scott Yeomans:
A Note on "Scheduling Unit-Time Tasks with Integer Release Times and Deadlines". Inf. Process. Lett. 47(3): 165-166 (1993) - 1992
- [j8]Jitender S. Deogun, George Steiner:
Hamiltonian Cycle is Polynomial on Cocomparability Graphs. Discret. Appl. Math. 39(2): 165-172 (1992) - 1990
- [j7]Kevin Ewacha, Ivan Rival, George Steiner:
Permutation Schedules for Flow Shops with Precedence Constraints. Oper. Res. 38(6): 1135-1139 (1990)
1980 – 1989
- 1989
- [j6]George Steiner:
Minimizing bumps in ordered sets by substitution decomposition. Discret. Math. 76(3): 285-289 (1989) - 1987
- [j5]George Steiner:
Searching in 2-Dimensional Partial Orders. J. Algorithms 8(1): 95-105 (1987) - 1986
- [j4]Jeffrey B. Sidney, George Steiner:
Optimal Sequencing by Modular Decomposition: Polynomial Algorithms. Oper. Res. 34(4): 606-612 (1986) - 1985
- [j3]George Steiner:
A compact labeling scheme for series-parallel graphs. Discret. Appl. Math. 11(3): 281-297 (1985) - 1984
- [j2]George Steiner:
Single Machine Scheduling with Precedence Constraints of Dimension 2. Math. Oper. Res. 9(2): 248-259 (1984) - [j1]George Steiner:
Mathematical aspects of scheduling and applications, by R. Bellman, A. O. Esogbue, and I. Nabeshima, Pergamon, London, 1982, 329 pp. Price: $19.50. Networks 14(1): 177-178 (1984)
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-25 22:43 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: