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

DOI10.1016/S0305-0548(00)00097-6zbMath0995.90026OpenAlexW2033807699MaRDI QIDQ1348546

Fawaz S. Al-Anzi, Ali Allahverdi

Publication date: 14 May 2002

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(00)00097-6

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints, A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times, A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents, Two-machine flow shop total tardiness scheduling problem with deteriorating jobs, A comparison of priority rules for minimizing the maximum lateness in tree data gathering networks, A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints, Bicriterion optimization for flow shop with a learning effect subject to release dates, A survey of scheduling problems with setup times or costs, A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations, Fast heuristics for minimizing the makespan in non-permutation flow shops, Flowshop-scheduling problems with makespan criterion: a review, A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application, A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times, Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm, Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times, Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests, The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing total tardiness in permutation flowshops
• On two-machine scheduling with release and due dates to minimize maximum lateness
• Job lateness in a two-machine flowshop with setup times separated
• A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
• The two-machine total completion time flow shop problem
• Improved heuristics for the \(n\)-job single-machine weighted tardiness problem
• Solution of the single machine total tardiness problem
• A decomposition algorithm for the single machine total tardiness problem
• Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
• Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness
• Job lateness in flowshops with setup and removal times separated
• An Evaluation of Flow Shop Sequencing Heuristics
• Scheduling alternative operations in two-machine flow-shops
• Minimizing makespan in parallel flowshops
• Minimizing Makespan in a Class of Reentrant Shops
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem