Some results of the relocation problems with processing times and deadlines

DOI10.1080/00207169108803998MaRDI QIDQ3979692zbMATH OpenOpenAlexWikidataFDO

Authors Miao-Tsong Lin, Shian-Shyong Tseng

Publication date 26 June 1992

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169108803998

zbMATH Keywords

NP-completenessschedulingrelocation problemdeadlinesprocessing timesproject and people management

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints
• Tight complexity analysis of the relocation problem with arbitrary release dates
• Relocation scheduling subject to fixed processing sequences
• Minimizing the total weighted completion time in the relocation problem
• ON FINDING THE MOST VITAL JOB IN RELOCATION PROBLEM

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A fast feasibility test for relocation problems
• Efficiency of a Good But Not Linear Set Union Algorithm
• New trends in machine scheduling
• Relocation problems are hard
• Scheduling subject to resource constraints: Classification and complexity
• Two-Processor Scheduling with Start-Times and Deadlines

Cited in

(14)

• Relocation problems of maximizing new capacities under a common due date
• Parametrized relocation of low-mobility resources
• On the relocation problem with a second working crew for resource recycling
• Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints
• Relocation scheduling subject to fixed processing sequences
• An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences
• A fast feasibility test for relocation problems
• On relocation problems with multiple identical working crews
• ON FINDING THE MOST VITAL JOB IN RELOCATION PROBLEM
• Minimizing the total weighted completion time in the relocation problem
• Generating the best \(K\) sequences in relocation problems
• Tight complexity analysis of the relocation problem with arbitrary release dates
• Emergency relocation of items using single trips: special cases of the multiple knapsack assignment problem
• Error estimates and adaptive finite element methods. A bibliography (1990--2000)

This page was built for publication: Some results of the relocation problems with processing times and deadlines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3979692)