Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Anass NAGIH
Exact and Heuristic Methods for Minimizing the Total Completion Time in Job-Shops
Studies in Informatics and Control
Electronic Engineering
Electrical
Computer Science
Related publications
Exact and Heuristic Methods for Network Completion for Time-Varying Genetic Networks
BioMed Research International
Immunology
Molecular Biology
Biochemistry
Microbiology
Medicine
Genetics
Heuristic and Exact Algorithms for the Two-Machine Just in Time Job Shop Scheduling Problem
Mathematical Problems in Engineering
Mathematics
Engineering
Minimizing Total Completion Time in Flowshop With Availability Constraint on the First Machine
Rule Based Heuristic Approach for Minimizing Total Flow Time in Permutation Flow Shop Scheduling
Tehnicki Vjesnik
Engineering
On-Line Scheduling of Unit Time Jobs With Rejection: Minimizing the Total Completion Time
Operations Research Letters
Industrial
Applied Mathematics
Manufacturing Engineering
Management Science
Operations Research
Software
An Exact Extended Formulation for the Unrelated Parallel Machine Total Weighted Completion Time Problem
Journal of Scheduling
Management Science
Engineering
Operations Research
Artificial Intelligence
Software
A Heuristic’s Job Order Gain in Pyramidal Preemptive Job Scheduling Problems for Total Weighted Completion Time Minimization
Information Technology and Management Science
Fast Exact and Heuristic Methods for Role Minimization Problems
A Polynomial Time Constant Approximation for Minimizing Total Weighted Flow-Time
