Kaminsky Philip

Philip Kaminsky

Information about the author Philip Kaminsky will soon be added to the site.
Found 12 papers in total
A linear programming‐based method for job shop scheduling
A linear programming‐based method for job shop scheduling
2013
We present a decomposition heuristic for a large class of job shop scheduling...
Combined make-to-order/make-to-stock supply chains
Combined make-to-order/make-to-stock supply chains
2009
A multi-item manufacturer served by a single supplier in a stochastic environment is...
Inventory, discounts, and the timing effect
Inventory, discounts, and the timing effect
2009
We introduce and analyze a model that explicitly considers the timing effect of...
Scheduling and due-date quotation in a make-to-order supply chain
Scheduling and due-date quotation in a make-to-order supply chain
2008
We consider a manufacturer, served by a single supplier, who has to quote due dates to...
Preemption in single machine earliness/tardiness scheduling
Preemption in single machine earliness/tardiness scheduling
2007
We consider a single machine earliness/tardiness scheduling problem with general...
Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs
Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs
2004
We consider the problem of scheduling customer orders in a flow shop with the...
Effective heuristics for capacitated production planning with multiperiod production and demand with forecast band refinement
Effective heuristics for capacitated production planning with multiperiod production and demand with forecast band refinement
2004
In this paper, we extend forecast band evolution and capacitated production modelling...
The effectiveness of the longest delivery time rule for the flow shop delivery time problem
The effectiveness of the longest delivery time rule for the flow shop delivery time problem
2003
In the flow shop delivery time problem, a set of jobs has to be processed on m...
The asymptotic optimality of the shortest processing time rule for the flow shop mean completion time problem
The asymptotic optimality of the shortest processing time rule for the flow shop mean completion time problem
2001
In the flow shop mean completion time problem, a set of jobs has to be processed on m...
Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates
Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates
2001
In the single machine mean completion time problem with release dates, a set of jobs...
Utilizing forecast band refinement for capacitated production planning
Utilizing forecast band refinement for capacitated production planning
2001
We present a model for forecast evolution that captures two notions related to...
Probabilistic analysis and practical algorithms for the flow shop weighted completion time problem
Probabilistic analysis and practical algorithms for the flow shop weighted completion time problem
1998
In the flow shop weighted completion time problem, a set of jobs has to be processed...
Papers per page: