Efficient neighborhood search for Just-in-Time scheduling problems
暂无分享,去创建一个
[1] Ross J. W. James,et al. A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem , 1997 .
[2] Francis Sourd. Scheduling a sequence of tasks with general completion costs , 2002 .
[3] Wlodzimierz Szwarc,et al. Optimal timing schedules in earliness-tardiness single machine sequencing , 1995 .
[4] Francis Sourd,et al. PERT scheduling with convex cost functions , 2003, Theor. Comput. Sci..
[5] Robert E. Tarjan,et al. One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties , 1988, Math. Oper. Res..
[6] John J. Kanet,et al. Single-machine scheduling with early and tardy completion costs , 1993 .
[7] Abraham P. Punnen,et al. A survey of very large-scale neighborhood search techniques , 2002, Discret. Appl. Math..
[8] Chris N. Potts,et al. An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem , 2002, INFORMS J. Comput..
[9] Roberto Tadei,et al. An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem , 2004, Oper. Res. Lett..
[10] Suresh P. Sethi,et al. Earliness-Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date , 1991, Oper. Res..