Publication | Date of Publication | Type |
---|
Fixed interval scheduling with third‐party machines | 2023-12-11 | Paper |
Single machine scheduling with assignable due dates to minimize maximum and total late work | 2023-07-10 | Paper |
Cost minimizing planning of container inspection and repair in multiple facilities | 2023-06-26 | Paper |
Two-machine flow-shop scheduling to minimize total late work: revisited | 2022-12-23 | Paper |
Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work | 2022-12-23 | Paper |
Stronger mixed-integer programming-formulations for order- and rack-sequencing in robotic mobile fulfillment systems | 2022-12-12 | Paper |
An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning | 2022-06-08 | Paper |
Provision-after-wait with preferences ordered by difference: tighter complexity and better approximation | 2021-06-03 | Paper |
Minimizing maximum cost for a single machine under uncertainty of processing times | 2020-05-27 | Paper |
The train-to-yard assignment problem | 2020-01-15 | Paper |
Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines | 2019-08-08 | Paper |
Straddle carrier routing at seaport container terminals in the presence of short term quay crane buffer areas | 2019-07-25 | Paper |
Solving the single crane scheduling problem at rail transshipment yards | 2019-06-20 | Paper |
Multiproduct batching and scheduling with buffered rework: The case of a car paint shop | 2019-05-02 | Paper |
A parallel machine schedule updating game with compensations and clients averse to uncertain loss | 2018-12-17 | Paper |
An overview of revenue management and dynamic pricing models in hotel business | 2018-08-10 | Paper |
The windy rural postman problem with a time-dependent zigzag option | 2018-05-25 | Paper |
A note on scheduling container storage operations of two non‐passing stacking cranes | 2018-04-27 | Paper |
Incentive compatible mechanisms for scheduling two-parameter job agents on parallel identical machines to minimize the weighted number of late jobs | 2018-04-20 | Paper |
An integrated model for the transshipment yard scheduling problem | 2018-04-03 | Paper |
Flight gate assignment and recovery strategies with stochastic arrival and departure times | 2017-07-06 | Paper |
Competitive location and pricing on networks with random utilities | 2017-06-20 | Paper |
Competitive location under proportional choice: 1-suboptimal points on networks | 2017-03-06 | Paper |
\((r|p)\)-centroid problems on networks with vertex and edge demand | 2016-11-11 | Paper |
A branch-and-bound algorithm for the acyclic partitioning problem | 2016-11-10 | Paper |
The partitioning min-max weighted matching problem | 2016-10-06 | Paper |
Mathematical formulations for a 1-full-truckload pickup-and-delivery problem | 2016-07-26 | Paper |
Scheduling dedicated jobs with variative processing times | 2016-02-23 | Paper |
Approximation algorithms for inventory constrained scheduling on a single machine | 2016-01-22 | Paper |
Minimizing maximum weight of subsets of a maximum matching in a bipartite graph | 2015-09-30 | Paper |
A truck scheduling problem arising in intermodal container transportation | 2015-07-28 | Paper |
Exact algorithms for inventory constrained scheduling on a single machine | 2014-08-18 | Paper |
Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs | 2014-08-01 | Paper |
New bounds and constraint propagation techniques for the clique partitioning problem | 2014-04-22 | Paper |
New bounds and algorithms for the transshipment yard scheduling problem | 2014-02-05 | Paper |
An FPTAS for the single-item capacitated economic lot-sizing problem with supply and demand | 2013-03-05 | Paper |
Flight gate scheduling with respect to a reference schedule | 2012-11-15 | Paper |
Sequential competitive location on networks | 2012-08-16 | Paper |
A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints | 2012-02-19 | Paper |
Revenue Maximization on Parallel Machines | 2011-04-07 | Paper |
A generic approach to proving NP-hardness of partition type problems | 2010-11-25 | Paper |
Recursive functions on the plane and FPTASs for production planning and scheduling problems with two facilities | 2009-11-25 | Paper |
Analysis, modeling and solution of the concrete delivery problem | 2008-11-18 | Paper |
A single-item economic lot-sizing problem with a non-uniform resource: Approximation | 2008-04-24 | Paper |
Disruption management in flight gate scheduling | 2007-10-26 | Paper |
Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date | 2007-10-10 | Paper |
Handbook on Scheduling | 2007-08-20 | Paper |
Selected papers from the Dagstuhl Workshop | 2007-05-15 | Paper |
A note on the two machine job shop with the weighted late work criterion | 2007-05-15 | Paper |
KI 2005: Advances in Artificial Intelligence | 2006-11-13 | Paper |
An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure | 2006-06-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q3368665 | 2006-02-08 | Paper |
The two-machine flow-shop problem with weighted late work criterion and common due date | 2005-04-21 | Paper |
A review of exact solution methods for the non-preemptive multiprocessor flowshop problem | 2005-03-08 | Paper |
Open shop scheduling problems with late work criteria. | 2004-01-26 | Paper |
A branch-and-bound algorithm for the resource-constrained project scheduling problem | 2003-08-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q4789912 | 2003-04-23 | Paper |
Constraint propagation and problem decomposition: A preprocessing procedure for the job shop problem | 2003-01-27 | Paper |
The disjunctive graph machine representation of the job shop scheduling problem | 2002-08-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q4494435 | 2002-02-05 | Paper |
https://portal.mardi4nfdi.de/entity/Q2735585 | 2001-09-02 | Paper |
Solving the open shop scheduling problem | 2001-08-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q2712360 | 2001-05-06 | Paper |
Constraint propagation techniques for the disjunctive scheduling problem | 2000-10-26 | Paper |
Model-based inference in CHARME. | 2000-06-21 | Paper |
Resource-constrained project scheduling: Notation, classification, models, and methods | 2000-06-14 | Paper |
A note on disjunctive graph representation | 2000-04-10 | Paper |
The job shop scheduling problem: Conventional and new solution techniques | 1998-10-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q4380372 | 1998-03-15 | Paper |
TSP ejection chains | 1997-08-11 | Paper |
Constraint Propagation Based Scheduling of Job Shops | 1997-01-22 | Paper |
Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue | 1996-04-29 | Paper |
Evolution based learning in a job shop scheduling environment | 1995-07-03 | Paper |
Fast Clustering Algorithms | 1994-08-21 | Paper |
Genetic local search in combinatorial optimization | 1994-03-24 | Paper |
Competitive location on a network | 1993-08-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q3994353 | 1992-09-17 | Paper |
Efficient characterizations of \(n\)-chromatic absolute retracts | 1992-06-28 | Paper |
Dismantling absolute retracts of reflexive graphs | 1989-01-01 | Paper |
A Radon theorem for Helly graphs | 1989-01-01 | Paper |
Products of absolute retracts | 1988-01-01 | Paper |
Minimal extensions of graphs to absolute retracts | 1987-01-01 | Paper |
A characterization of absolute retracts of n-chromatic graphs | 1985-01-01 | Paper |