Production scheduling problem in a factory of automobile component primer painting
Published 2020 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
Production scheduling problem in a factory of automobile component primer painting
Authors
Keywords
-
Journal
JOURNAL OF INTELLIGENT MANUFACTURING
Volume -, Issue -, Pages -
Publisher
Springer Science and Business Media LLC
Online
2020-01-02
DOI
10.1007/s10845-019-01524-6
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- An integrated production scheduling and delivery route planning with multi-purpose machines: A case study from a furniture manufacturing company
- (2019) S. Mohammadi et al. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
- An agile scheduling and control approach in ETO construction supply chains
- (2019) Patrick Dallasega et al. COMPUTERS IN INDUSTRY
- New index priority rules for no-wait flow shops
- (2018) Christos Koulamas et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Emergency orders in the periodic-review inventory system with fixed ordering costs and stochastic lead times for normal orders
- (2018) Søren Glud Johansen INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
- Dynamic scheduling of parallel heat treatment furnaces: A case study at a manufacturing system
- (2018) Adil Baykasoğlu et al. JOURNAL OF MANUFACTURING SYSTEMS
- A survey of case studies in production scheduling: Analysis and perspectives
- (2018) Helio Yochihiro Fuchigami et al. Journal of Computational Science
- Minimizing the resource consumption of heterogeneous batch-processing machines using a copula-based estimation of distribution algorithm
- (2018) Chuang Liu et al. APPLIED SOFT COMPUTING
- Lean manufacturing and sustainable performance: Trends and future challenges
- (2018) Rafael Henao et al. JOURNAL OF CLEANER PRODUCTION
- A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server
- (2018) Gulcin Bektur et al. COMPUTERS & OPERATIONS RESEARCH
- Classifying and modeling setups and cleanings in lot sizing and scheduling
- (2017) Bryndis Stefansdottir et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Makespan minimization in flowshop batch processing problem with different batch compositions on machines
- (2017) Hossein N.Z. Matin et al. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
- A survey of scheduling problems with no-wait in process
- (2016) Ali Allahverdi EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Scheduling flexible flow shop with recirculation and machine sequence-dependent processing times: formulation and solution procedures
- (2016) Hannu Ahonen et al. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
- An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem
- (2015) Jian-Ya Ding et al. APPLIED SOFT COMPUTING
- Total completion time with makespan constraint in no-wait flowshops with setup times
- (2014) Ali Allahverdi et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- A heuristic-search genetic algorithm for multi-stage hybrid flow shop scheduling with single processing machines and batch processing machines
- (2014) Dongni Li et al. JOURNAL OF INTELLIGENT MANUFACTURING
- A survey of multi-factory scheduling
- (2014) J. Behnamian et al. JOURNAL OF INTELLIGENT MANUFACTURING
- Minimization of weighted earliness and tardiness for no-wait sequence-dependent setup times flowshop scheduling problem
- (2013) Sedighe Arabameri et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Algorithms for no-wait flowshops with total completion time subject to makespan
- (2013) Ali Allahverdi et al. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
- A heuristic for no-wait flow shop scheduling
- (2013) Sagar U. Sapkal et al. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
- Particle swarm optimization for scheduling batch processing machines in a permutation flowshop
- (2012) Purushothaman Damodaran et al. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
- Realistic two-stage flowshop batch scheduling problems with transportation capacity and times
- (2011) J. Behnamian et al. APPLIED MATHEMATICAL MODELLING
- Makespan minimization of a flowshop sequence-dependent group scheduling problem
- (2011) Nasser Salmasi et al. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
- Scheduling two-stage hybrid flow shops with parallel batch, release time, and machine eligibility constraints
- (2011) I.-Lin Wang et al. JOURNAL OF INTELLIGENT MANUFACTURING
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
- (2010) Chuyang Wang et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem
- (2010) Krzysztof Fleszar et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Multi-objective optimization algorithms for flow shop scheduling problem: a review and prospects
- (2010) Yi Sun et al. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
- Fifty years of scheduling: a survey of milestones
- (2009) C N Potts et al. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
- Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration
- (2008) Lixin Tang et al. APPLIED MATHEMATICAL MODELLING
- A fast hybrid tabu search algorithm for the no-wait job shop problem
- (2008) Wojciech Bożejko et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Minimizing makespan in a two-machine flowshop scheduling with batching and release time
- (2008) Lixin Tang et al. MATHEMATICAL AND COMPUTER MODELLING
- An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops
- (2007) Ching-Fang Liaw COMPUTERS & OPERATIONS RESEARCH
Create your own webinar
Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.
Create NowAsk a Question. Answer a Question.
Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.
Get Started