Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications
Journal of the ACM (JACM)
Deterministic Processor Scheduling
ACM Computing Surveys (CSUR)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The Three-Machine No-Wait Flow Shop is NP-Complete
Journal of the ACM (JACM)
Exact solution of large-scale, asymmetric traveling salesman problems
ACM Transactions on Mathematical Software (TOMS)
Scheduling of a manufacturing cell with simulation
WSC '86 Proceedings of the 18th conference on Winter simulation
On the complexity of unique solutions
Journal of the ACM (JACM)
Flow-shop scheduling for three serial stations with the last two duplicate
Computers and Operations Research
Simple heuristics for scheduling with limited intermediate storage
Computers and Operations Research
An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
Computers and Operations Research
An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
Computers and Operations Research
Data & Knowledge Engineering
Journal of Scheduling
Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Computers and Operations Research
Minimizing total completion time in two-machine flow shops with exact delays
Computers and Operations Research
Semi-dynamic Demand in a Non-permutation Flowshop with Constrained Resequencing Buffers
Large-Scale Scientific Computing
Computers and Industrial Engineering
Information Sciences: an International Journal
Flow shop-based scheduling approach for bag-of-task grid applications
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
MIP formulations for flowshop scheduling with limited buffers
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers
Applied Soft Computing
Fitness landscape analysis for the no-wait flow-shop scheduling problem
Journal of Heuristics
An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers
Mathematical and Computer Modelling: An International Journal
Some complexity results in cyclic scheduling
Mathematical and Computer Modelling: An International Journal
On the high multiplicity traveling salesman problem
Discrete Optimization
Solving the Fm\block\Cmax problem using Bounded Dynamic Programming
Engineering Applications of Artificial Intelligence
No-Wait flowshop scheduling is as hard as asymmetric traveling salesman problem
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Hi-index | 0.00 |