| Publication | Date of Publication | Type |
|---|
Server scheduling on parallel dedicated machines with fixed job sequences
Naval Research Logistics | 2019-08-12 | Paper |
Preemptive parallel-machine scheduling with a common server to minimize makespan
Naval Research Logistics | 2019-05-02 | Paper |
Block models for scheduling jobs on two parallel machines with a single server
Computers & Operations Research | 2016-11-10 | Paper |
Erratum to: ``Minimizing total tardiness on parallel machines with preemptions
Journal of Scheduling | 2014-08-18 | Paper |
Minimizing total weighted completion time approximately for the parallel machine problem with a single server
Information Processing Letters | 2014-05-05 | Paper |
Parallel machine problems with equal processing times: a survey
Journal of Scheduling | 2014-02-05 | Paper |
Minimizing total tardiness on parallel machines with preemptions
Journal of Scheduling | 2014-02-05 | Paper |
Scheduling with multiple servers
Automation and Remote Control | 2011-01-03 | Paper |
Parallel machine scheduling problems with a single server
Mathematical and Computer Modelling | 2010-05-06 | Paper |
Minimizing the number of machines for scheduling jobs with equal processing times
European Journal of Operational Research | 2009-12-07 | Paper |
Scheduling jobs with equal processing times and time windows on identical parallel machines
Journal of Scheduling | 2009-08-28 | Paper |
On a parallel machine scheduling problem with equal processing times
Discrete Applied Mathematics | 2009-06-30 | Paper |
Preemptive scheduling on uniform machines to minimize mean flow time
Computers & Operations Research | 2009-05-19 | Paper |
The complexity of mean flow time scheduling problems with release times
Journal of Scheduling | 2007-05-15 | Paper |
Scheduling equal processing time jobs to minimize the weighted number of late jobs
JMMA. Journal of Mathematical Modelling and Algorithms | 2006-11-17 | Paper |
Complexity results for parallel machine problems with a single server
Journal of Scheduling | 2003-02-23 | Paper |
A heuristic algorithm for minimizing mean flow time with unit setups
Information Processing Letters | 2002-07-14 | Paper |
On the complexity of minimizing the number of late jobs in unit time open shop
Discrete Applied Mathematics | 2000-01-30 | Paper |
Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem
Discrete Applied Mathematics | 2000-01-30 | Paper |
Preemptive job-shop scheduling problems with a fixed number of jobs
Mathematical Methods of Operations Research | 1999-09-07 | Paper |
Two-machine shop scheduling with zero and unit processing times
European Journal of Operational Research | 1999-07-11 | Paper |
| scientific article; zbMATH DE number 1294395 (Why is no real title available?) | 1999-06-01 | Paper |
On the complexity of two machine job-shop scheduling with regular objective functions
OR Spektrum | 1997-12-04 | Paper |
| scientific article; zbMATH DE number 894722 (Why is no real title available?) | 1996-07-01 | Paper |
| scientific article; zbMATH DE number 781227 (Why is no real title available?) | 1995-09-27 | Paper |
| scientific article; zbMATH DE number 781223 (Why is no real title available?) | 1995-09-27 | Paper |
Optimal schedules with infinitely large stability radius∗
Optimization | 1995-06-21 | Paper |
| scientific article; zbMATH DE number 4018682 (Why is no real title available?) | 1983-01-01 | Paper |
