This chapter represents the state of the art at the time of release. Readers are encouraged to consult the link below for the version of this chapter with the most recent release date:

We consider online versions of the Traveling Salesman Problem (TSP) in Euclidean space, where the natural offline problem is the classical TSP with (city) release dates (a city release date is the time after which the city must be served). We analyze in turn the non-negative real line R+, the real line R and finally the general case R. The first part of the paper analyzes the version of the onl...

Martin A. Weinstock, MD, PhD Professor of Dermatology and Community Health Alpert Medical School Brown University Providence, Rhode Island Original Release Date: December 2011 Most Recent Review Date: December 2011 Expiration Date: December 2013 Estimated Time to Complete Activity: 2.0 hour(s) Medium or Combination of Media Used: Written Supplement Method of Physician Participation: Journal Sup...

Doc. Ref.: Responsible Beneficiary : Editor(s): Edward Ho (HSG) List of contributors: Alain Pastor (ALBLF), Edward Ho (HSG), Alexander Salinas Segura (UniW), Ralf Kernchen (UniS), Sonja Meyer (SAP), Johannes Riedl (Siemens), Alessandro Bassi (HEU) Reviewers: Alexander Salinas Segura (UniW) Contractual Delivery Date: M3 Actual Delivery Date: November 30, 2010 Status: Final Version and date Chang...

In this paper, we address the scheduling model with discretely compressible release dates, where processing any job with a compressed release date incurs a corresponding compression cost. We consider the following problem: scheduling with discretely compressible release dates to minimize the sum of makespan plus total compression cost. We show its NP-hardness, and design an approximation algori...

Global warming and climate change are threatening life on earth. These changes due to human activities resulting in the emission of greenhouse gases. This is caused by intensive industrial excessive fuel energy consumption. Recently, scheduling production systems has been judged be an effective way reduce field green scheduling, which aims allocate jobs machines order minimize total costs, with...