A two-machine flowshop problem with processing time-dependent buffer constraints—An application in multimedia presentations - Lin, Feng-Cheng; Hong, Jen-Shin; Lin, Bertrand M.T. (Computers & operations research, 2009)
Keywords: Algorithms; Applied sciences; Branch & bound algorithms; Buffer constraint; Exact sciences and technology; Game theory; Job shops; Multimedia; Multimedia presentation; Object sequence optimization; Operational research and scientific management; Operational research. Management science; Production scheduling; Scheduling, sequencing; Simulation; Studies; Two-machine flowshop; Two-machine flowshop; Object sequence optimization; Multimedia presentation; Buffer constraint; Multimedia; Lower bound; Multiple machine; High density; Branch and bound method; Processing time; Scheduling; Buffer system; Precedence constraint; Due date; Optimization; Time dependence; Upper bound; Television; NP hard problem; Flow shop; Execution time