Steiner George

George Steiner

Information about the author George Steiner will soon be added to the site.
Found 30 papers in total
Single-machine scheduling with periodic maintenance to minimize makespan revisited
Single-machine scheduling with periodic maintenance to minimize makespan revisited
2014
In this paper, a single‐machine scheduling problem with periodic maintenance...
Fast algorithms for scheduling with learning effects and time‐dependent processing times on a single machine
Fast algorithms for scheduling with learning effects and time‐dependent processing times on a single machine
2013
We consider scheduling problems with learning/deterioration effects and...
Single machine batch scheduling with release times and delivery costs
Single machine batch scheduling with release times and delivery costs
2013
We study single machine batch scheduling with release times. Our goal is to minimize...
Minimizing the weighted number of tardy jobs with due date assignment and capacity‐constrained deliveries
Minimizing the weighted number of tardy jobs with due date assignment and capacity‐constrained deliveries
2011
We study a supply chain scheduling problem, where a common due date is assigned to all...
A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
2011
We study a single‐machine scheduling problem in a flexible framework where both...
On the asymptotic behavior of subtour‐patching heuristics in solving the TSP on permuted Monge matrices
On the asymptotic behavior of subtour‐patching heuristics in solving the TSP on permuted Monge matrices
2011
We examine the performance of different subtour‐patching heuristics for solving...
Just-in-time scheduling with controllable processing times on parallel machines
Just-in-time scheduling with controllable processing times on parallel machines
2010
We study scheduling problems with controllable processing times on parallel machines....
Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains
Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains
2009
We study a supply chain scheduling problem in which n jobs have to be scheduled on a...
Optimal due date assignment and resource allocation to minimize the weighted number of tardy jobs on a single machine
Optimal due date assignment and resource allocation to minimize the weighted number of tardy jobs on a single machine
2007
With the increased emphasis on the effective management of operational issues in...
The single-machine earliness–tardiness scheduling problem with due date assignment and resource-dependent processing times
The single-machine earliness–tardiness scheduling problem with due date assignment and resource-dependent processing times
2008
We study the earliness–tardiness scheduling problem on a single machine with due...
Batch scheduling in a two-level supply chain – a focus on the supplier
Batch scheduling in a two-level supply chain – a focus on the supplier
2006
This paper studies the batch scheduling problem in a supply chain from the supplier's...
Single machine batch scheduling to minimize total completion time and resource consumption costs
Single machine batch scheduling to minimize total completion time and resource consumption costs
2007
In this paper we study the single-machine batch scheduling problem under batch...
Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
2007
We study the approximability of minimum total weighted tardiness with a modified...
On the connection between a cyclic job shop and a reentrant flow shop scheduling problem
On the connection between a cyclic job shop and a reentrant flow shop scheduling problem
2006
Hall et al. investigated the cycle time minimization problem in a two-machine job...
Scheduling in reentrant robotic cells: algorithms and complexity
Scheduling in reentrant robotic cells: algorithms and complexity
2005
We study the scheduling of m -machine reentrant robotic cells, in which parts need to...
Two due date assignment problems in scheduling a single machine
Two due date assignment problems in scheduling a single machine
2006
We study two single-machine scheduling problems: minimizing the sum of weighted...
Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times
Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times
2002
We consider the two-machine flow-shop problem with release times where the objective...
A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times
A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times
2001
We consider the three-machine permutation flow-shop scheduling problem with release...
Approximation methods for discrete lot streaming in flow shops
Approximation methods for discrete lot streaming in flow shops
1997
Lot streaming is the process of splitting a job or lot to allow overlapping between...
Discrete lot streaming in two-machine flow shops
Discrete lot streaming in two-machine flow shops
1999
Lot streaming is the process of splitting a job or lot to allow overlapping between...
Optimal level schedules in mixed-model, multi-level JIT assembly systems with pegging
Optimal level schedules in mixed-model, multi-level JIT assembly systems with pegging
1996
Solving the level (or balanced) schedule problem is the most important scheduling goal...
Lot streaming with detached setups in three-machine flow shops
Lot streaming with detached setups in three-machine flow shops
1997
Lot streaming is the process of splitting a job or lot to allow overlapping between...
Optimal level schedules for mixed-model, multi-level just-in-time assembly systems
Optimal level schedules for mixed-model, multi-level just-in-time assembly systems
1997
Solving the level (or balanced) schedule problem is the most important scheduling goal...
Level schedules for mixed-model, Just-in-Time processes
Level schedules for mixed-model, Just-in-Time processes
1993
A mixed-model manufacturing facility running under a Just-in-Time (JIT) production...
Papers per page: