759
Views
6
CrossRef citations to date
0
Altmetric
Research Articles

Multicriteria models for just-in-time scheduling

Pages 3191-3209 | Received 03 Jun 2009, Accepted 25 Feb 2010, Published online: 19 May 2010

References

  • Baglin , G . 2001 . Management industriel et logistique . Economica , : 549
  • Baker , KR and Jia , D . 1993 . A comparative study of lot streaming procedures . OMEGA International Journal of Management Science , 21 ( 5 ) : 561 – 566 .
  • Baker , KR and Scudder , GD . 1990 . Sequencing with earliness and tardiness penalties: A review . Operations Research , 38 ( 1 ) : 22 – 36 .
  • Bulbul , K , Kaminsky , P and Yano , C . 2004 . Flow shop scheduling with earliness, tardiness and intermediate inventory holding costs . Naval Research Logistics , 51 : 407 – 445 .
  • Chang , JH and Chiu , HH . 2005 . A comprehensive review of lot-streaming . International Journal of Production Research , 43 ( 8 ) : 1515 – 1536 .
  • Chrétienne , P and Sourd , F . 2003 . PERT scheduling with convex cost functions . Theoretical Computer Science , 292 ( 1 ) : 145 – 164 .
  • Dauzère-Pérès , S and Lasserre , J-B . 1997 . Lot streaming in job-shop scheduling . Operations Research , 45 ( 4 ) : 584 – 595 .
  • Della Croce , F and Trubian , M . 2002 . Optimal idle time insertion in early–tardy parallel machines scheduling with precedence constraints . Production Planning and Control , 13 ( 2 ) : 133 – 142 .
  • Estève , B . 2006 . A Recovering Beam Search algorithm for the single machine Just-in-Time scheduling problem . European Journal of Operational Research , 172 ( 3 ) : 798 – 813 .
  • Garey , MR , Tarjan , RE and Wilfong , GT . 1988 . One-processor scheduling with symmetric earliness and tardiness penalties . Mathematics of Operations Research , 13 ( 2 ) : 330 – 348 .
  • Gordon , V , Proth , J-M and Chu , C . 2002a . Due date assignment and scheduling: SLK, TWK and other due date assignement models . Production Planning and Control , 13 ( 2 ) : 157 – 177 .
  • Gordon , V , Proth , J-M and Chu , C . 2002b . A survey of the state-of-the-art of common due date assignment and scheduling research . European Journal of Operational Research , 139 ( 1 ) : 1 – 25 .
  • Gordon , VS , Proth , J-M and Strusevich , VA . 2004 . “ Scheduling with due-date assignment ” . In Handbook of scheduling: Algorithms, models and performance analysis. , New York : Chapman & Hall/CRC Press . Chapter 21
  • Graham , RL . 1979 . Optimization and approximation in deterministic sequencing and scheduling: A survey . Annals of Discrete Mathematics , 5 : 287 – 326 .
  • Hall , NG and Posner , ME . 1991 . Earliness–tardiness scheduling problems, I: Weighted deviation of completion times about a common due date . Operations Research , 39 : 836 – 846 .
  • Hendel , Y and Sourd , F . 2007 . An improved earliness–tardiness timing algorithm . Computers and Operations Research , 34 : 2931 – 2938 .
  • Jin , B , Luh , PB and Thakur , LS . 1999 . An effective optimization-based algorithm for job shop scheduling with fixed-size transfert lots . Journal of Manufacturing Systems , 18 ( 4 ) : 284 – 300 .
  • Kaminsky , P and Hochbaum , D . 2004 . “ Due-date quotation models and algorithms ” . In Handbook of scheduling: Algorithms, models and performance analysis. , New York : Chapman & Hall/CRC Press . Chapter 20
  • Kannan , VR and Tan , KC . 2005 . Just in Time, total quality management and supply chain management: Understanding their linkages and impact on business performance . Omega , 33 ( 2 ) : 153 – 162 .
  • Nollet , J , Kélada , J and Diorio , MO . 1994 . La gestion des opérations et de la production , 682 Gaëtan Morin .
  • Pan , Y and Shi , L . 2005 . Dual constrained single machine sequencing to minimize total weighted completion time . IEEE Transactions on Automation, Science and Engineering , 2 ( 4 ) : 344 – 357 .
  • Pinedo , M and Chao , X . 1999 . Operations scheduling with applications in manufacturing and services , Boston : McGraw-Hill .
  • Potts , C and van Wassenhove , LN . 1994 . Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity . Journal of the Operational Research Society , 43 ( 5 ) : 395 – 406 .
  • Ramasesh , RV . 2000 . Lot streaming in multistage production systems . International Journal of Production Economics , 66 ( 3 ) : 199 – 211 .
  • Sarin , SC and Jaiprakash , P . 2007 . Flow shop lot streaming , Berlin : Springer .
  • Schonberger , JR . 1982 . Japanese manufacturing techniques: Nine hidden lessons in simplicity , New York : The Free Press .
  • Shi , L and Pan , Y . 2003 . Minimizing job shop inventory with on-time delivery guarantees . Journal of Systems Science and Systems Engineering , 12 ( 4 ) : 449 – 469 .
  • Sourd , F . 2005 . Optimal timing of a sequence of tasks with general completion costs . European Journal of Operational Research , 165 ( 1 ) : 82 – 96 .
  • Szwarc , W and Mukhopadhyay , SK . 1995 . Optimal timing schedules in earliness–tardiness single machine sequencing . Naval Research Logistics , 42 : 1109 – 1114 .
  • T'kindt , V and Billaut , J-C . 2006 . Multicriteria scheduling. Theory, models and algorithms , Heidelberg : Springer .
  • Triesch , D and Baker , KR . 1994 . Basic techniques for lot streaming . Operations Research , 41 : 1065 – 1076 .
  • Tseng , C-T and Liao , C-J . 2008 . A discrete particle swarm optimization for lot-streaming flowshop scheduling problem . European Journal of Operational Research , 191 ( 2 ) : 360 – 373 .
  • Yoon , SH and Ventura , JA . 2002a . Minimizing the mean weighted absolute deviation from due dates in lot-streaming flowshop scheduling . Computers & Operations Research , 29 ( 10 ) : 1301 – 1315 .
  • Yoon , SH and Ventura , JA . 2002b . An application of genetic algorithms to lot-streaming flow shop scheduling . IIE Transactions , 34 ( 9 ) : 779 – 787 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.