Advanced search
Publication Cover
International Journal of Production Research Volume 57, 2019 - Issue 2
Submit an article Journal homepage
195
Views
13
CrossRef citations to date
0
Altmetric
Articles

Semi-V-shape property for two-machine no-wait proportionate flow shop problem with TADC criterion

Sergey KovalevINSEEC Business School, Lyon, France.Correspondence[email protected]
,
Mikhail Y. KovalyovNational Academy of Sciences of Belarus, United Institute of Informatics Problems, Minsk, Belarus.
,
Gur MosheiovThe Jerusalem School of Business Administration, The Hebrew University, Jerusalem, Israel.
&
Enrique GerstlThe Jerusalem School of Business Administration, The Hebrew University, Jerusalem, Israel.;School of Industrial Engineering, Jerusalem College of Technology, Jerusalem, Israel.
Pages 560-566 | Received 12 Sep 2017, Accepted 16 Apr 2018, Published online: 14 May 2018

References

  • Bagchi, U. , Y. Chang , and R. Sullivan . 1987. “Minimizing Absolute and Squared Deviations of Completion Times with Different Earliness and Tardiness Penalties and a Common due date.” Naval Research Logistics Quarterly 34: 739–751.
  • Baker, K. R. , and G. D. Scudder . 1990. “Sequencing with Earliness and Tardiness Penalties: A Review.” Operations Research 38 (10): 22–36.
  • Ben-Yehoshua, Y. , E. Hariri , and G. Mosheiov . 2015. “A Note on Minimising Total Absolute Deviation of Job Completion Times on a Two-machine no-wait Proportionate Flowshop.” International Journal of Production Research 53 (19): 5717–5724.
  • Biskup, D. , and M. Feldmann . 2005. “On Scheduling Around Large Restrictive Common due Windows.” European Journal of Operational Research 162: 740–761.
  • Cai, X. 1996. “V-shape Property for Job Sequences that Minimize the Expected Completion Time Variance.” European Journal of Operational Research 91: 118–123.
  • Eilon, S. , and I. G. Chowdhury . 1977. “Minimizing Waiting Time Variance in the Single Machine Problem.” Management Science 23: 567–575.
  • Emmons, H. , and G. Vairaktarakis . 2013. “Flow Shop Scheduling. Theoretical Results, Algorithms, and Applications.” International Series in Operations Research & Management Science 182.
  • Gerstl, E. , and G. Mosheiov . 2013. “Due-window Assignment Problems with Unit-time Jobs.” Applied Mathematics and Computation 220: 487–495.
  • Hall, N. G. 1986. “Single- and Multiple-processor Models for Minimizing Completion Time Variance.” Naval Research Logistics Quarterly 33: 49–54.
  • Hall, N. G. , W. Kubiak , and S. P. Sethi . 1991. “Earliness-tardiness Scheduling Problems, II: Deviation of Completion Times about a Restrictive Common due date.” Operations Research 39 (5): 847–856.
  • Hall, N. G. , and C. Sriskandarajah . 1996. “A Survey of Machine Scheduling Problems with Blocking and No-wait in Process.” Operations Research 44:510–525.
  • Hardy, G. H. , J. E. Littlewood , and G. Polya . 1934. Inequalities. Cambridge: Cambridge University Press.
  • Hassin, R. , and M. Shani . 2005. “Machine Scheduling with Earliness.” Tardiness and Non-execution Penalties, Computers & Operations Research 32: 683–705.
  • Janiak, A. , W. Janiak , M. Y. Kovalyov , and F. Werner . 2011. “Soft due Window Assignment and Scheduling of Unit Time Jobs on Parallel Machines.” 4OR 10 (4):347–360.
  • Kanet, J. 1981. “Minimizing Variation of Flow Time in Single Machine Systems.” Management Science 27: 1453–1459.
  • Kanet, J. 1981. “Minimizing the Average Deviation of Job Completion Times about a Common due date.” Naval Research Logistics Quarterly 28 (4): 643–651.
  • Mani, V. , P.-C. Chang , and S. H. Chen . 2010. “A Parametric Analysis for Single-machine Scheduling with Past-sequence-dependent Setup Times.” International Journal of Innovative Computing 6 (3A): 1113–1121.
  • Mani, V. , P. C. Chang , and S. H. Chen . 2011. “Single-machine Scheduling with Past-sequence-dependent Setup Times and Learning Effects: A Parametric Analysis.” International Journal of Systems Science 42 (12): 2097–2102.
  • Merten, A. G. , and M. E. Muller . 1972. “Variance Minimization in Single Machine Sequencing Problems.” Management Science 18: 518–528.
  • Raghavachari, M. 1986. “A V-shape Property of Optimal Schedule of Jobs about a Common due date.” European Journal of Operational Research 23 (3): 401–402.

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:

Order Reprints Request Corporate Permissions

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:

Request Academic Permissions

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.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.