Proportional lot-sizing and scheduling problem with identical parallel machines

Kaczmarczyk, Waldemar

doi:10.1080/00207543.2010.532929

Cited by 29 publications

(23 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The PLSP is the most flexible small bucket model, because it allows the processing of two products in a single period, one before and one after the set-up operation. It has been extended for several special cases, among others for the case with long (multi period) setup times (Suerie, 2005;Kaczmarczyk, 2009a) and for the case with identical parallel machines (Kaczmarczyk, 2011). General surveys on lot-sizing and scheduling models can be found in Drexl and Kimms (1997) or Jans and Degraeve (2008).…”

Section: Introductionmentioning

confidence: 99%

Extended Model Formulation of the Proportional Lot-Sizing and Scheduling Problem with Lost Demand Costs

Kaczmarczyk

2011

dmms

Self Cite

View full text Add to dashboard Cite

Abstract. We consider mixed-integer linear programming (MIP) models of production planning problems known as the small bucket lot-sizing and scheduling problems. We present an application of a class of valid inequalities to the case with lost demand (stock-out) costs. Presented results of numerical experiments made for the the Proportional Lot-sizing and Scheduling Problem (PLSP) confirm benefits of such extended model formulation.

show abstract

Section: Introductionmentioning

confidence: 99%

Extended Model Formulation of the Proportional Lot-Sizing and Scheduling Problem with Lost Demand Costs

Kaczmarczyk

2011

dmms

Self Cite

View full text Add to dashboard Cite

show abstract

“…the initial set-up of machines is feasible. The plsp/f model (Kaczmarczyk, 2011) may be stated as follows:…”

Section: Model With Identical Parallel Machinesmentioning

confidence: 99%

“…Suerie (2006) proved that this model is not correct and proposed two new models refining the idea from Haase (1994). Finally, Kaczmarczyk (2011) presented another plsp formulation assuming constant period length.…”

Section: Introduction This Paper Addresses Mixed-integer Programming mentioning

confidence: 99%

“…In this paper a new model formulation is presented for the plsp with identical parallel machines (Kaczmarczyk, 2011), which allows set-up operations to overlap two periods. Increasing the capabilities of computers and mip solvers increases the possibility of applying standard mip methods to solve real planning problems.…”

Section: Introduction This Paper Addresses Mixed-integer Programming mentioning

confidence: 99%

“…At a practical level, identical solutions are examined many times. Therefore, Kaczmarczyk (2011) proposed a new model, denoted plsp/f, which aggregates the machines and uses integer variables. This model uses sequence-dependent change-over variables to describe a flow of machines set-up state between products.…”

Section: Introduction This Paper Addresses Mixed-integer Programming mentioning

confidence: 99%

See 2 more Smart Citations

Modelling Set-up Times Overlapping Two Periods in the Proportional Lot-Sizing Problem with Identical Parallel Machines

Kaczmarczyk

2013

DMMS

Self Cite

View full text Add to dashboard Cite

Abstract. This paper presents a new mixed integer programming model for the Proportional Lot-Sizing Problem (plsp) with identical parallel machines and set-up times overlapping two periods. The proposed model assumes constant period length and explicitly calculates the distribution of set-up operations among periods. The presented results of computational experiments with standard mip methods prove that the untying set-ups from period borders enables the reduction of the total costs in optimal solutions.

show abstract

Solving a Discrete Lot Sizing and Scheduling Problem with Unrelated Parallel Machines and Sequence Dependent Setup Using a Generic Decision Support Tool

Klement

Silva

Gibaru

2017

Advances in Production Management Systems. The Path to Intelligent, Collaborative and Sustainable Manufacturing

View full text Add to dashboard Cite

Part 7: Operations Planning, Scheduling and ControlInternational audienceIn any manufacturing systems, planning and scheduling are not intuitive. Some dedicate tools may exist to help some specific companies to daily plan and assign their activities. Our purpose is to develop a generic decision support tool to solve any planning or scheduling problems. To do so, we use a hybridization between a metaheuristic and a list algorithm. The metaheuristic is generic to any studied problems. The list algorithm needs to be specific to the considered problem. The use of our tool needs a minimum work development. In this paper, our proposal is illustrated by the case study of a textile company which intends to schedule its production, by assigning it resources and dates. This problem can be seen as a Discrete Lot Sizing and scheduling Problem (DLSP)

show abstract

Proportional lot-sizing and scheduling problem with identical parallel machines

Cited by 29 publications

References 21 publications

Extended Model Formulation of the Proportional Lot-Sizing and Scheduling Problem with Lost Demand Costs

Extended Model Formulation of the Proportional Lot-Sizing and Scheduling Problem with Lost Demand Costs

Modelling Set-up Times Overlapping Two Periods in the Proportional Lot-Sizing Problem with Identical Parallel Machines

Solving a Discrete Lot Sizing and Scheduling Problem with Unrelated Parallel Machines and Sequence Dependent Setup Using a Generic Decision Support Tool

Contact Info

Product

Resources

About