Fuzzy cleaner production in assembly flexible job-shop scheduling with machine breakdown and batch transportation: Lagrangian relaxation

M. Hajibabaei and J. Behnamian ()
Additional contact information
M. Hajibabaei: Bu-Ali Sina University
J. Behnamian: Bu-Ali Sina University

Journal of Combinatorial Optimization, 2023, vol. 45, issue 5, No 2, 26 pages

Abstract: Abstract In production scheduling with assembly operations, after processing jobs in the first stage, in the second one, assembly operations are performed. Making these two decisions is very important because optimizing the scheduling of jobs in one stage of production without considering the parameters and capacities of the next stage in the assembly stage will not guarantee the shortening of the total production time and the optimal use of machines. In this study, a mathematical model has been developed for a flexible job-shop scheduling problem with assembly operation. In the first stage, the scheduling is performed according to the job release times and machine breakdowns. Then, jobs enter the assembly stage in a flow-shop environment, and finally, the assembled products are sent to customers in batches. Here, three objective functions must be minimized simultaneously, including (i) the costs of tardiness, earliness, fuzzy transportation, and makespan, (ii) the fuzzy emission of CO2, and (iii) the noise pollution. In this research, after linearization of the proposed model, using the ε-constraint methods and Lagrangian relaxation algorithm, its complexity was reduced. The comparison results of the proposed algorithm and the model that was solved with the GAMS show that the Lagrangian relaxation algorithm is quite efficient.

Keywords: Flexible job-shop scheduling problem; Assembly stage; Lagrangian relaxation; Cleaner production (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-023-01046-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:45:y:2023:i:5:d:10.1007_s10878-023-01046-1

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-023-01046-1

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().