Simulated annealing and genetic algorithm based method for a bi-level \textit{seru} loading problem with worker assignment in \textit{seru} production systems
From MaRDI portal
Publication:2031373
Recommendations
- Scheduling problem in seru production system considering DeJong's learning effect and job splitting
- Attaining flexibility in seru production system by means of Shojinka: an optimization model and solution approaches
- Exact method based on solution space cut for bi-objective Seru production
- Formulations, features of solution space, and algorithms for line-pure \textit{seru} system conversion
- Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect
Cites work
- A PSO-based procedure for a bi-level multi-objective TOC-based job-shop scheduling problem
- A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times
- An implementation framework for seru production
- Bi-level multi-objective mathematical model for job-shop scheduling: the application of theory of constraints
- Bi-level multiple mode resource-constrained project scheduling problems under hybrid uncertainty
- Descent approaches for quadratic bilevel programming
- Equation of state calculations by fast computing machines
- scientific article; zbMATH DE number 702365 (Why is no real title available?)
- Mathematical analysis and solutions for multi-objective line-cell conversion problem
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Optimization by simulated annealing
- Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine
- Single-machine scheduling and due date assignment with rejection and position-dependent processing times
- Single-machine scheduling with past-sequence-dependent delivery times and a linear deterioration
- The polynomial hierarchy and a simple model for competitive analysis
- Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects
Cited in
(8)- Formulations, features of solution space, and algorithms for line-pure \textit{seru} system conversion
- Attaining flexibility in seru production system by means of Shojinka: an optimization model and solution approaches
- Scheduling problem in seru production system considering DeJong's learning effect and job splitting
- Exact method based on solution space cut for bi-objective Seru production
- Modelling and a hybrid genetic algorithm for the equity-oriented worker assignment problem in seru production systems
- A bi-objective approach for the multi-skilled worker assignment of a hybrid assembly line-seru production system
- An exact branch-and-bound algorithm for \textit{seru} scheduling problem with sequence-dependent setup time and release date
- Joint decision-making for divisional \textit{seru} scheduling and worker assignment considering process sequence constraints
This page was built for publication: Simulated annealing and genetic algorithm based method for a bi-level \textit{seru} loading problem with worker assignment in \textit{seru} production systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2031373)
