Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

Ronald Graham; Eugene L. Lawler; Jan Karel Lenstra; A. H. G. Rinnooy Kan

doi:10.1016/s0167-5060(08)70356-x

Keywords

Flow shop schedulingComputer scienceMathematical optimizationJob shop schedulingFair-share schedulingScheduling (production processes)Dynamic priority schedulingOpen shopRate-monotonic schedulingMathematicsSchedule

Affiliated Institutions

Related Publications

Contraction Mappings in the Theory Underlying Dynamic Programming

Eric V. Denardo

Next article Contraction Mappings in the Theory Underlying Dynamic ProgrammingEric V. DenardoEric V. Denardohttps://doi.org/10.1137/1009030PDFBibTexSections ToolsAdd to favorite...

1967 SIAM Review 464 citations

Publication Info

Year: 1979
Type: book-chapter
Pages: 287-326
Citations: 5688
Access: Closed

External Links

View on DOI.org

Social Impact

Altmetric

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

5688

OpenAlex

Cite This

APA Style

                            
                                    Ronald Graham, 
                                
                                    Eugene L. Lawler, 
                                
                                    Jan Karel Lenstra
                                
                                et al.
                            
                            (1979). 
                            Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey. 
                            Annals of discrete mathematics
                            
                            , 287-326.
                            https://doi.org/10.1016/s0167-5060(08)70356-x

Identifiers

DOI: 10.1016/s0167-5060(08)70356-x