| Publication | Date of Publication | Type |
|---|
Formulating a scheduling problem with almost identical jobs by using positional completion times
Integer Programming and Combinatorial Optimization | 2022-08-30 | Paper |
Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop
4OR | 2021-08-09 | Paper |
Are stacker crane problems easy? A statistical study
Computers \& Operations Research | 2016-11-14 | Paper |
Tactical fixed job scheduling with spread-time constraints
Computers \& Operations Research | 2016-11-10 | Paper |
Increasing the revenue of self-storage warehouses by optimizing order scheduling
European Journal of Operational Research | 2016-10-07 | Paper |
Two-machine interval shop scheduling with time lags
Journal of Scheduling | 2015-11-12 | Paper |
An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
INFORMS Journal on Computing | 2012-05-30 | Paper |
Approximation algorithms for the parallel flow shop problem
European Journal of Operational Research | 2012-05-14 | Paper |
On-line two-machine job shop scheduling with time lags
Information Processing Letters | 2012-03-12 | Paper |
Polynomial-time approximation schemes for scheduling problems with time lags
Journal of Scheduling | 2010-11-03 | Paper |
On-line two-machine open shop scheduling with time lags
European Journal of Operational Research | 2010-01-15 | Paper |
Roll cutting in the curtain industry, or: a well-solvable allocation problem
European Journal of Operational Research | 2007-08-27 | Paper |
Lower bounds for minimizing total completion time in a two-machine flow shop
Journal of Scheduling | 2007-05-15 | Paper |
Applying Column Generation to Machine Scheduling
Column Generation | 2006-10-16 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Multi-product lot-sizing with a transportation capacity reservation contract
European Journal of Operational Research | 2005-05-12 | Paper |
Parallel machine scheduling by column generation
Operations Research | 2002-02-07 | Paper |
Scheduling with target start times
European Journal of Operational Research | 2001-03-12 | Paper |
Positioning automated guided vehicles in a loop layout
European Journal of Operational Research | 2001-02-22 | Paper |
Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine
Mathematical Programming. Series A. Series B | 1999-10-18 | Paper |
Minimizing makespan in a pallet-constrained flowshop
Journal of Scheduling | 1999-10-05 | Paper |
Scheduling deteriorating jobs to minimize makespan
| 1999-06-10 | Paper |
scientific article; zbMATH DE number 1263270 (Why is no real title available?)
| 1999-03-16 | Paper |
Scheduling a batching machine
Journal of Scheduling | 1999-01-11 | Paper |
Minimizing Makespan In Flowshops With Pallet Requirements: Computational Complexity
INFOR: Information Systems and Operational Research | 1998-09-07 | Paper |
scientific article; zbMATH DE number 1175952 (Why is no real title available?)
| 1998-07-19 | Paper |
Minimizing Makespan in a Class of Reentrant Shops
Operations Research | 1998-06-08 | Paper |
A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time
INFORMS Journal on Computing | 1998-04-05 | Paper |
scientific article; zbMATH DE number 1031383 (Why is no real title available?)
| 1998-02-05 | Paper |
Earliness-Tardiness Scheduling Around Almost Equal Due Dates
INFORMS Journal on Computing | 1998-01-15 | Paper |
Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
Operations Research Letters | 1997-03-23 | Paper |
Dual decomposition of a single-machine scheduling problem
Mathematical Programming. Series A. Series B | 1996-02-12 | Paper |
Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
Mathematical Programming. Series A. Series B | 1996-02-06 | Paper |
Complexity of scheduling multiprocessor tasks with prespecified processors allocations
Discrete Applied Mathematics | 1995-02-01 | Paper |
New Lower and Upper Bounds for Scheduling Around a Small Common Due Date
Operations Research | 1994-11-06 | Paper |
Duality-Based Algorithms for Scheduling Unrelated Parallel Machines
ORSA Journal on Computing | 1993-12-09 | Paper |
A new lower bound approach for single-machine multicriteria scheduling
Operations Research Letters | 1993-01-16 | Paper |
Scheduling around a small common due date
European Journal of Operational Research | 1992-06-28 | Paper |
Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
Annals of Operations Research | 1990-01-01 | Paper |
A simpler and faster algorithm for optimal total-work-content-power due data determination
Mathematical and Computer Modelling | 1990-01-01 | Paper |
