A bicriteria flowshop scheduling with a learning effect
From MaRDI portal
Publication:949943
DOI10.1016/j.apm.2007.06.009zbMath1145.90382OpenAlexW2010514722MaRDI QIDQ949943
Publication date: 22 October 2008
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2007.06.009
bicriteria schedulingmakespanflowshop schedulingcompletion timelearning effectinteger programming modelheuristic methods
Related Items (13)
A bicriteria parallel machine scheduling with a learning effect of setup and removal times ⋮ Several flow shop scheduling problems with truncated position-based learning effect ⋮ Note on a single-machine scheduling problem with sum of processing times based learning and ready times ⋮ Notes on ``A bicriteria flowshop scheduling with a learning effect ⋮ A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function ⋮ A bicriteria \(m\)-machine flowshop scheduling with sequence-dependent setup times ⋮ Genetic Algorithm for a Two-Agent Scheduling Problem with Truncated Learning Consideration ⋮ Two-agent scheduling with position-based deteriorating jobs and learning effects ⋮ A single machine scheduling problem with availability constraints and sequence-dependent setup costs ⋮ Scheduling jobs with position and sum-of-processing-time based processing times ⋮ Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect ⋮ A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect ⋮ Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop
- Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
- A new heuristic method for the flow shop sequencing problem
- Single-machine scheduling with learning considerations
- Flowshop sequencing with mean flowtime objective
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- The two-machine total completion time flow shop problem
- Genetic algorithms for the two-stage bicriteria flowshop problem
- Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- A bicriteria two-machine permutation flowshop problem
- Heuristics for scheduling in flowshop with multiple objectives
- A heuristic algorithm for mean flowtime objective in flowshop scheduling
- No-wait flowshops with bicriteria of makespan and maximum lateness.
- Improved genetic algorithm for the permutation flowshop scheduling problem.
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
- A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
- A bicriteria approach to the two-machine flow shop scheduling problem
- A new branch-and-bound approach for the \(n/2\)/flowshop/\(\alpha F+\beta C_{\text{max}}\) flowshop scheduling problem
- Future paths for integer programming and links to artificial intelligence
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
- An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
- The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime
- Two-machine flowshop scheduling with a secondary criterion
- Scheduling with general job-dependent learning curves.
- The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm
- A bi-criterion single-machine scheduling problem with learning considerations
- Common due date scheduling with autonomous and induced learning
- A new heuristic for the n-job, M-machine flow-shop problem
- Minimizing total tardiness in a scheduling problem with a learning effect
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- The Tricriteria Two-Machine Flowshop Scheduling Problem
- Optimal two- and three-stage production schedules with setup times included
- A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime
- A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling Problem
- ANALYSIS FOR MINIMIZING WEIGHTED MEAN FLOW-TIME IN FLOW-SHOP SCHEDULING
- Two-Stage Flowshop Scheduling Problem with Bicriteria
- Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n / 2 / F / F¯
- Flowshop and Jobshop Schedules: Complexity and Approximation
- AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM
- A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
- No-wait flowshops with bicriteria of makespan and total completion time
- Parallel machine scheduling with a learning effect
- Note on scheduling with general learning curves to minimize the number of tardy jobs
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
- A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- Single machine scheduling with learning effect considerations
- Scheduling problems with a learning effect
- Local search heuristics for two-stage flow shop problems with secondary criterion
This page was built for publication: A bicriteria flowshop scheduling with a learning effect
