Efficient Algorithms for a Scheduling Problem and its Applications to Illicit Drug Market Crackdowns

Pu Cai, Jin-yi Cai and Ashish V. Naik
Additional contact information
Pu Cai: State University of New York at Buffalo
Jin-yi Cai: State University of New York at Buffalo
Ashish V. Naik: University of Chicago

Journal of Combinatorial Optimization, 1998, vol. 1, issue 4, No 3, 367-376

Abstract: Abstract We give polynomial time algorithms for a job scheduling problem. By duality we transform a special case of the drug market crackdown schedulingproblem to the above job scheduling problem and thus derive polynomial timealgorithms to the second problem. Finally, using the algorithm for the specialcase, we develop a quasipolynomial time approximation algorithm for thegeneral case of the drug market crackdown scheduling problem with monomialcost functions.

Keywords: job scheduling problem; drug market crackdown scheduling problem; duality; polynomial time algorithm; quasipolynomial time approximation algorithm (search for similar items in EconPapers)
Date: 1998
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1023/A:1009738610804 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:1:y:1998:i:4:d:10.1023_a:1009738610804

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/A:1009738610804

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().