Advanced search
Publication Cover
American Journal of Mathematical and Management Sciences Volume 38, 2019 - Issue 2
Submit an article Journal homepage
81
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

Approximation Scheme for Order Acceptance and Scheduling on a Single Machine with a Reserved Job

Mengjie WuFaculty of Science, Ningbo University, Ningbo, PR ChinaView further author information
,
Hao TianFaculty of Science, Ningbo University, Ningbo, PR ChinaView further author information
&
Wenchang LuoFaculty of Science, Ningbo University, Ningbo, PR ChinaCorrespondence[email protected]
ORCID Iconhttp://orcid.org/0000-0002-0335-3253View further author information
ORCID Icon
Pages 117-124 | Received 06 Nov 2017, Accepted 05 Jun 2018, Published online: 25 Oct 2018

References

  • Bartal, Y., Leonardi, S., Marchetti-Spaccamela, A., Sgall, J., & Stougie, L. (2000). Multiprocessor scheduling with rejection. SIAM Journal on Discrete Mathematics, 13(1), 64–78.
  • Diedrich, F., Jansen, K., Pascual, F., & Trystram, D. (2010). Approximation algorithms for scheduling with reservations. Algorithmica, 58(2), 391–404.
  • Engels, D. W., Karger, D. R., Kolliopoulos, S. G., Sengupta, S., Uma, R. N., & Wein, J. (2003). Techniques for scheduling with rejection. Journal of Algorithms, 49(1), 175–191.
  • Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 236–287.
  • Garey, M. R., & Johnson, D. S. (1979). A Guide to the Theory of NP-Completeness. New York: WH Freemann.
  • Scharbrodt, M., Steger, A., & Weisser, H. (1999). Approximability of scheduling with fixed jobs. Journal of Scheduling, 2(6), 267–284.
  • Slotnick, S. A. (2011). Order acceptance and scheduling: A taxonomy and review. European Journal of Operational Research, 212(1), 1–11.
  • Shabtay, D., & Gasper, N. (2012). Two-machine flow-shop scheduling with rejection. Computers & Operations Research, 39(5), 1087–1096.
  • Shabtay, D., Gaspar, N., & Kaspi, M. (2013). A survey on offline scheduling with rejection. Journal of Scheduling, 16(1), 3–28.
  • Zhang, L., Lu, L., & Yuan, J. (2009). Single machine scheduling with release dates and rejection. European Journal of Operational Research, 198(3), 975–978.
  • Zhang, L., Lu, L., & Yuan, J. (2016). Two-machine open-shop scheduling with rejection to minimize the makespan. Or Spectrum, 38(2), 519–529.

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.

Supercharge Your Next Research Paper: Research and write your next paper with Jenni AI.

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.