Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications

Computers and Operations Research

Volumn 29, Issue 8, 2002, Pages 971-994

  Allahverdi, Ali ^a   Al Anzi, Fawaz S ^a  

^a KUWAIT UNIVERSITY   (Kuwait)

Author keywords

Flowshop; Maximum lateness; Multimedia; Scheduling; World Wide Web

Indexed keywords

HEURISTIC METHODS; MULTIMEDIA SYSTEMS; OPTIMIZATION;

FLOWSHOP PROBLEM;

WORLD WIDE WEB;

MULTIMEDIA;

EID: 0036643164     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(00)00097-6     Document Type: Article

References (28)

1. Complexity of machine scheduling problems
2. On two-machine scheduling with release dates and due dates to minimize maximum lateness
3. Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness
4. Optimal policies for a deterministic two-machine semi-ordered flowshop with maximum lateness objective
5. Job lateness in a two-machine flowshop with setup times separated
6. Job lateness in flowshops with setup and removal times separated
7. A review of scheduling research involving setup considerations
8. Design and evaluation of data allocation algorithms for distributed multimedia database systems
9. Optimal two-stage production scheduling with setup times separated
10. Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
11. The two-machine total completion time flow shop problem
12. A heuristic for the m-machine, n-job flowshop sequencing problem
13. Generating experimental data for scheduling problems
14. A heuristic for the n-job, m-machine sequencing problem
15. An evaluation of flowshop sequencing heuristics
16. Minimizing makespan in a class of reentrant shops
17. Scheduling alternative operations in two-machine flow-shops
18. Minimizing makespan in parallel flowshops
19. A decomposition algorithm for the single machine total tardiness problem
20. Improved heuristics for the n-job single machine weighted tardiness problem
21. Solution of the single machine total tardiness problem
22. A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops
23. Minimizing total tardiness in permutation flowshops
24. A branch and bound algorithm to minimize total tardiness with different release dates