Some results of the relocation problems with processing times and deadlines
From MaRDI portal
Publication:3979692
DOI10.1080/00207169108803998zbMATH Open0738.68044OpenAlexW2136687547WikidataQ126244724 ScholiaQ126244724MaRDI QIDQ3979692FDOQ3979692
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
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
- Title not available (Why is that?)
- Efficiency of a Good But Not Linear Set Union Algorithm
- A fast feasibility test for relocation problems
- Scheduling subject to resource constraints: Classification and complexity
- Relocation problems are hard
- Two-Processor Scheduling with Start-Times and Deadlines
- New trends in machine scheduling
Cited In (9)
- Relocation problems of maximizing new capacities under a common due date
- 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
- A fast feasibility test for relocation problems
- ON FINDING THE MOST VITAL JOB IN RELOCATION PROBLEM
- On relocation problems with multiple identical working crews
- Minimizing the total weighted completion time in the relocation problem
- Generating the best \(K\) sequences in relocation problems
- 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)
