A priority based unbalanced time minimization assignment problem

DOI10.1007/S12597-019-00399-8MaRDI QIDQ2307977zbMATH OpenOpenAlexWikidataFDO

Authors Ekta Jain, Kalpana Dahiya, Vanita Verma

Publication date 25 March 2020

Published in Opsearch (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12597-019-00399-8

zbMATH Keywords

unbalancedassignmentpriorityconstrainedtime minimization

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• A priority based assignment problem
• An improved algorithm for two stage time minimization assignment problem
• A variant of time minimizing assignment problem
• Exact algorithms for the imbalanced time minimizing assignment problem
• On a pair of job-machine assignment problems with two stages

Cites work

• scientific article; zbMATH DE number 3617900 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• scientific article; zbMATH DE number 3231693 (Why is no real title available?)
• A modified method for solving the unbalanced assignment problems
• A new greedy algorithm for the quadratic assignment problem
• A priority based assignment problem
• A variant of time minimizing assignment problem
• Algorithm for the solution of the bottleneck assignment problem
• Algorithms for the Assignment and Transportation Problems
• Alternate strategies for solving bottleneck assignment problems - analysis and computational results
• An efficient approximation for the generalized assignment problem
• Bottleneck assignment problems under categorization
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Lexicographic bottleneck problems
• On the bottleneck assignment problem
• On the quadratic assignment problem
• P-Complete Approximation Problems
• Solution methods and computational investigations for the linear bottleneck assignment problem
• Solving the assignment problem using genetic algorithm and simulated annealing
• Some Generalisations of the Time Minimising Assignment Problem
• Some special cases of assignment problems
• Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
• The assignment problem under categorized jobs
• The assignment problem with three job categories
• The quadratic assignment problem
• Tight approximation algorithms for maximum general assignment problems

Cited in

(4)

• An alternate approach to solve two-level priority based assignment problem
• scientific article; zbMATH DE number 147743 (Why is no real title available?)
• A variant of time minimizing assignment problem
• Optimizing hyperparameters in Hopfield neural networks using evolutionary search

This page was built for publication: A priority based unbalanced time minimization assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2307977)