The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs

Lecture Notes in Computer Science - Germany
doi 10.1007/bfb0028568
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

A Polynomial-Time Algorithm for the Paired-Domination Problem on Permutation Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2009English

A Hybrid EDA With GA for the Permutation Flow Shop Scheduling Problem

Operations Research and Fuzziology
2015English

A Simheuristic for Bi-Objective Stochastic Permutation Flow Shop Scheduling Problem

Journal of Project Management
2019English

A Random Key Based Estimation of Distribution Algorithm for the Permutation Flowshop Scheduling Problem

2017English

A Utility Accrual Scheduling Algorithm for Real-Time Activities With Mutual Exclusion Resource Constraints

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
2006English

Heuristics and Metaheuristics for the Distributed Assembly Permutation Flowshop Scheduling Problem With Sequence Dependent Setup Times

International Journal of Production Economics
ManagementBusinessEconomicsManufacturing EngineeringManagement ScienceIndustrialAccountingEconometricsOperations Research
2015English

On Vertex Ranking for Permutation and Other Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1994English

Modified Self-Adaptive Local Search Algorithm for a Biobjective Permutation Flow Shop Scheduling Problem

Turkish Journal of Electrical Engineering and Computer Sciences
Electronic EngineeringElectricalComputer Science
2019English

A Width Parameter Useful for Chordal and Co-Comparability Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy