Solving the Fm∣block∣Cmax problem using Bounded Dynamic Programming

Bautista, Joaquı́n; Cano, Alberto; Companys, Ramón; Ribas, Imma

doi:10.1016/j.engappai.2011.09.001

Cited by 22 publications

(18 citation statements)

References 29 publications

(35 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where the _ values for the problem / / / are obtained directly with procedure MILP-1, the _ values correspond to the maximum value between _ and the lower limit from procedure MILP-2 for problem / / / . Meanwhile, the values of * are confirmed as optimal through procedure MILP-1, and the 0 value originates from the literature for problem / / (Bautista et al 2012). An analysis of Tables 3-6 reveals the following: − Procedure MILP-1 obtains and ensures optimal solutions in all instances with 20 jobs (Set-1), 50 jobs (Set-4) and 100 jobs (Set-1d).…”

mentioning

confidence: 80%

Mixed integer linear programming models for Flow Shop Scheduling with a demand plan of job types

Valhondo

Pozo

2018

Cent Eur J Oper Res

View full text Add to dashboard Cite

This paper presents two Mixed Integer Linear Programming (MILP) models that extend two basic Flow Shop Scheduling problems: / / and / /. This extension incorporates the concept of an overall demand plan for types of jobs or products. After using an example to illustrate the new problems under study, we evaluated the new models and analyzed their behaviors when applied to instances found in the literature and industrial instances of a case study from Nissan's plant in Barcelona. CPLEX solver was used as a solution tool and obtained acceptable results, allowing us to conclude that MILP can be used as a method for solving Flow Shop Scheduling problems with an overall demand plan.

show abstract

mentioning

confidence: 80%

Mixed integer linear programming models for Flow Shop Scheduling with a demand plan of job types

Valhondo

Pozo

2018

Cent Eur J Oper Res

View full text Add to dashboard Cite

show abstract

“…Therefore, using the notation proposed by Graham et al [11], both the Fm/prmu/ problems [1,10,13,20,22,23] as the Fm/block/ problems [4,8,16,18,21] are particular cases of the family Fm/ / /d i , when d i = 1 for all i ∈ I.…”

Section: Preliminariesmentioning

confidence: 99%

“…The equality (3) determines the minimum time of completion of the t-th job t in production sequence (T) in machine k ∈ K ∶ C k,t t . Meanwhile, the equality (4) determines the minimum start time S k,t of the t-th job t in (T) in machine k ∈ K. Formula (5) serves to count the number of jobs of type i ∈ I in the partial sequence (t) ⊆ (T) . The conditions (6) impose the Quota property on the manufacturing sequence (T) .…”

Section: Model Q-fspmentioning

confidence: 99%

Exact and heuristic procedures for the Heijunka-flow shop scheduling problem with minimum makespan and job replicas

Valhondo

2021

Prog Artif Intell

View full text Add to dashboard Cite

In this paper, a new problem of job sequences in a workshop is presented, taking into account non-unit demands for the jobs and whose objective is to minimize the total completion time for all the jobs ($${C}_{max}$$ C max ) satisfying a set of restrictions imposed on the problem to preserve the production mix. Two procedures are proposed to solve the new problem: Mixed Integer Linear Programming and a Metaheuristic based on Multistart and Local Search. The two proposed procedures are tested using instance set Nissan-9Eng.I, in both cases giving rise to highly satisfactory performance both in quality of solutions obtained and in the CPU times required. Through a case study of the Nissan engine manufacturing plant in Barcelona, our economic-productive analysis reveals that it is possible to save an average of € 1162.83 per day, manufacturing 270 engines, when we transform the current assembly line into a Heijunka-Flow Shop.

show abstract

“…If the units have heterogeneous processing times, in the stages of the production process in a workshop, we are facing permutation problems such as Flow-Shop Problems (Bautista, Cano, Companys and Ribas, 2012;Pan and Ruíz 2013). When the processing time of any operation depends on the number of units it is convenient to sequence the units in batches of pieces.…”

Section: Preliminariesmentioning

confidence: 99%

Consideration of human resources in the Mixed-model Sequencing Problem with Work Overload Minimization: Legal provisions and productivity improvement

Bautista

Alfaro-Pozo

Batalla-García

2015

Expert Systems with Applications

Self Cite

View full text Add to dashboard Cite

Abstract:Beginning with a variation of the sequencing problem in a mixed-products line (MMSP-W: Mixed-Model Sequencing Problem with Workload Minimization), we propose two new models that incorporate a set of working conditions in regard with human resources of workstations on the line. These conditions come from collective agreements and therefore must be respected by both company and labor unions. The first model takes into account the saturation limit of the workstations, and the second model also includes the activation of the operators throughout the working day. Two computational experiments were carried out using a case study of the Nissan motor plant in Barcelona with two main objectives: (1) to study the repercussions of the saturation limit on the decrease in productivity on the line and (2) to evaluate the recovery of productivity on the line via both activation of operators, while maintaining the same quality in working conditions achieved by limiting the saturation, and auxiliary processors. By results we state that saturation limitation leads an important increase of work overload, which means average economic losses of 28,731.8 Euros/day. However, the productivity reduction may be counteracted by the work pace factor increase, at certain moments of workday, and/or by the incorporation of auxiliary processors into the line.Keywords: Sequencing; Mixed-product line; Work overload; Saturation; Activity factor; Manufacturing operations. PreliminariesCurrently, many production systems exist in which the manufacture or assembly of an entire product (or a subcomponent of the product) is carried out on the production line. At the same time, the increasing market requirements demand that companies offer a wide range of products with different options. This situation is commonly found in the automotive industry in which different products are manufactured and although these products belong to the same family, they have variable characteristics that require different component consumption and resource use, such as different processing times of operations. Obviously, not all vehicles share the same type of motor, and not all are equipped with the same components.Assembly lines in the automotive industry are a clear example of this type of mixedproduct lines, which are known as Mixed-model Assembly Line (MMAL). In this type of C onsideration of human resources in the Mixed-Model Sequencing Problem with Work O verload M inimization: Legal provisions and productivity improvement J. Bautista, R. Alfaro-Pozo, C. Batalla-García 2 lines, different components (seats, steering wheels, pedals, etc.) are incorporated into the vehicle body depending on the type of vehicle that is assembled at each moment. Therefore, these lines must be flexible and able to adapt to each type of product assembled in them without incurring excessive costs.In this way, to increase flexibility and reduce costs in terms of both workforce and storage, the MMALs face two basic problems: (1) the balancing of the line, known in the literature as th...

show abstract

Solving the Fm∣block∣Cmax problem using Bounded Dynamic Programming

Cited by 22 publications

References 29 publications

Mixed integer linear programming models for Flow Shop Scheduling with a demand plan of job types

Mixed integer linear programming models for Flow Shop Scheduling with a demand plan of job types

Exact and heuristic procedures for the Heijunka-flow shop scheduling problem with minimum makespan and job replicas

Consideration of human resources in the Mixed-model Sequencing Problem with Work Overload Minimization: Legal provisions and productivity improvement

Contact Info

Product

Resources

About