default search action
Steef L. van de Velde
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j37]Arianna Alfieri
, Shuyu Zhou, Rosario Scatamacchia, Steef L. van de Velde:
Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop. 4OR 19(2): 265-288 (2021)
2010 – 2019
- 2016
- [j36]Xiandong Zhang
Increasing the revenue of self-storage warehouses by optimizing order scheduling. Eur. J. Oper. Res. 252(1): 69-78 (2016) - 2015
- [j35]Xiandong Zhang
Two-machine interval shop scheduling with time lags. J. Sched. 18(4): 359-368 (2015) - 2014
- [j34]Shuyu Zhou
Tactical fixed job scheduling with spread-time constraints. Comput. Oper. Res. 47: 53-60 (2014) - [i1]Shuyu Zhou, Xiandong Zhang, Bo Chen, Steef L. van de Velde:
Tactical Fixed Job Scheduling with Spread-Time Constraints. CoRR abs/1402.1881 (2014) - 2013
- [j33]Faith Jordan Srour
Are Stacker Crane Problems easy? A statistical study. Comput. Oper. Res. 40(3): 674-690 (2013) - 2012
- [j32]Xiandong Zhang
Approximation algorithms for the parallel flow shop problem. Eur. J. Oper. Res. 216(3): 544-552 (2012) - 2010
- [j31]Xiandong Zhang
On-line two-machine open shop scheduling with time lags. Eur. J. Oper. Res. 204(1): 14-19 (2010) - [j30]Xiandong Zhang
On-line two-machine job shop scheduling with time lags. Inf. Process. Lett. 110(12-13): 510-513 (2010) - [j29]Edmund K. Burke
Editorial. J. Sched. 13(1): 1 (2010) - [j28]Xiandong Zhang
Polynomial-time approximation schemes for scheduling problems with time lags. J. Sched. 13(5): 553-559 (2010)
2000 – 2009
- 2009
- [j27]Edmund K. Burke
Editorial. J. Sched. 12(1): 1-2 (2009) - 2008
- [j26]Michael L. Pinedo, Steef L. van de Velde:
Editorial 10th anniversary volume (volume 11). J. Sched. 11(1): 1 (2008) - 2007
- [j25]Arianna Alfieri, Steef L. van de Velde, Gerhard J. Woeginger:
Roll cutting in the curtain industry, or: A well-solvable allocation problem. Eur. J. Oper. Res. 183(3): 1397-1404 (2007) - [j24]Arianna Alfieri, Leo G. Kroon, Steef L. van de Velde:
Personnel scheduling in a complex logistic system: a railway application case. J. Intell. Manuf. 18(2): 223-232 (2007) - [j23]Edmund K. Burke
Editorial. J. Sched. 10(1): 3-4 (2007) - [c6]Elfriede Krauth, Jos van Hillegersberg, Steef L. van de Velde:
Agent-based Human-computer-interaction for Real-time Monitoring Systems in the Trucking Industry. HICSS 2007: 27 - 2006
- [j22]Edmund K. Burke
Editorial. J. Sched. 9(1): 5 (2006) - [j21]Han Hoogeveen, Linda van Norden, Steef L. van de Velde:
Lower bounds for minimizing total completion time in a two-machine flow shop. J. Sched. 9(6): 559-568 (2006) - 2005
- [j20]Linda van Norden, Steef L. van de Velde:
Multi-product lot-sizing with a transportation capacity reservation contract. Eur. J. Oper. Res. 165(1): 127-138 (2005) - [j19]Edmund K. Burke
Editorial. J. Sched. 8(1): 5 (2005) - [c5]Arianna Alfieri, Steef L. van de Velde, Gerhard J. Woeginger:
Roll Cutting in the Curtain Industry. ESA 2005: 283-292 - 2004
- [j18]Edmund K. Burke, Michael L. Pinedo, Steef L. van de Velde:
Editorial. J. Sched. 7(1): 5 (2004) - 2003
- [j17]Ruud H. Koning
Introduction: Sport and Computers. Eur. J. Oper. Res. 148(2): 231-232 (2003) - 2002
- [j16]Marjan van den Akker, Han Hoogeveen, Steef L. van de Velde:
Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem. INFORMS J. Comput. 14(1): 37-51 (2002) - [j15]Richard K. Congram, Chris N. Potts, Steef L. van de Velde:
An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem. INFORMS J. Comput. 14(1): 52-67 (2002) - 2001
- [j14]J. A. Hoogeveen, Steef L. van de Velde:
Scheduling with target start times. Eur. J. Oper. Res. 129(1): 87-94 (2001) - 2000
- [j13]A. J. R. M. Gademann
Positioning automated guided vehicles in a loop layout. Eur. J. Oper. Res. 127(3): 565-573 (2000)
1990 – 1999
- 1999
- [j12]J. M. van den Akker, J. A. Hoogeveen, Steef L. van de Velde:
Parallel Machine Scheduling by Column Generation. Oper. Res. 47(6): 862-872 (1999) - 1998
- [j11]Han Hoogeveen, Steef L. van de Velde:
Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine. Math. Program. 82: 273-289 (1998) - 1997
- [j10]Han Hoogeveen, Steef L. van de Velde:
Earliness-Tardiness Scheduling Around Almost Equal Due Dates. INFORMS J. Comput. 9(1): 92-99 (1997) - [j9]M. Y. Wang, S. P. Sethi, Steef L. van de Velde:
Minimizing Makespan in a Class of Reentrant Shops. Oper. Res. 45(5): 702-712 (1997) - 1996
- [j8]J. A. Hoogeveen, Steef L. van de Velde:
A Branch-and-Bound Algorithm for Single-Machine Earliness-Tardiness Scheduling with Idle Time. INFORMS J. Comput. 8(4): 402-412 (1996) - 1995
- [j7]Steef L. van de Velde:
Dual decomposition of a single-machine scheduling problem. Math. Program. 69: 413-428 (1995) - [j6]J. A. Hoogeveen, Steef L. van de Velde:
Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems. Math. Program. 70: 173-190 (1995) - [j5]J. A. Hoogeveen, Steef L. van de Velde:
Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time. Oper. Res. Lett. 17(5): 205-208 (1995) - [c4]Han Hoogeveen, Steef L. van de Velde:
Formulating a Scheduling Problem with Almost Identical Jobs by Using Positional Completion Times. IPCO 1995: 292-306 - 1994
- [j4]J. A. Hoogeveen, Steef L. van de Velde, Bart Veltman:
Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations. Discret. Appl. Math. 55(3): 259-272 (1994) - [j3]J. A. Hoogeveen, H. Oosterhout, Steef L. van de Velde:
New Lower and Upper Bounds for Scheduling Around a Small Common Due Date. Oper. Res. 42(1): 102-110 (1994) - 1993
- [j2]Steef L. van de Velde:
Duality-Based Algorithms for Scheduling Unrelated Parallel Machines. INFORMS J. Comput. 5(2): 192-205 (1993) - [c3]J. A. Hoogeveen, Steef L. van de Velde:
Stronger Lagrangian bounds by use of slack variables: applications to machine scheduling problems. IPCO 1993: 195-208 - 1992
- [j1]J. A. Hoogeveen, Steef L. van de Velde:
A new lower bound approach for single-machine multicriteria scheduling. Oper. Res. Lett. 11(1): 39-44 (1992) - [c2]J. A. Hoogeveen, H. Oosterhout, Steef L. van de Velde:
New Lower and Upper Bounds for Scheduling Around a Small Common Due Date. IPCO 1992: 122-135 - 1990
- [c1]Steef L. van de Velde:
Dual Decomposition of Single Machine Scheduling Problems. IPCO 1990: 495-507
Coauthor Index
aka: J. A. Hoogeveen
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-24 23:18 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: