list.iid.ciirc.cvut.cz
Sign In Sign Up
Manage this list Sign In Sign Up

Keyboard Shortcuts

Thread View

  • j: Next unread message
  • k: Previous unread message
  • j a: Jump to all threads
  • j l: Jump to MailingList overview

Scheduling seminar

Thread Start a new thread
Download
Threads by month
  • ----- 2025 -----
  • June
  • May
  • April
  • March
  • February
  • January
  • ----- 2024 -----
  • December
  • November
  • October
  • September
  • August
  • July
  • June
  • May
  • April
  • March
  • February
  • January
  • ----- 2023 -----
  • December
  • November
  • October
  • September
  • August
  • July
  • June
  • May
  • April
  • March
  • February
  • January
  • ----- 2022 -----
  • December
  • November
  • October
  • September
  • August
  • July
  • June
  • May
  • April
  • March
  • February
  • January
  • ----- 2021 -----
  • December
  • November
  • October
  • September
  • August
  • July
  • June
  • May
  • April
  • March
schedulingseminar@rtime.felk.cvut.cz

May 2025

  • 1 participants
  • 2 discussions
Zhi-Long Chen (Univ of Maryland) | May 21 | Online Integrated Production and Distribution Scheduling
by Zdenek Hanzalek 19 May '25

19 May '25
Dear scheduling researcher, We are delighted to announce the talk given by Zhi-Long Chen (Univ of Maryland). The title is "Online Integrated Production and Distribution Scheduling". The seminar will take place on Zoom on Wednesday, May 21 at 13:00 UTC. Join Zoom Meeting https://cesnet.zoom.us/j/96828038614?pwd=2muPtkXSwJC5pmFj9hLblhFPvUlHuZ.1 Meeting ID: 968 2803 8614 Passcode: 878236 You can follow the seminar online or offline on our Youtube channel as well: https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A The abstract follows. As a growing number of companies adopt make-to-order business model or sell their products online, we are seeing numerous decision problems that can be modeled as integrated production and distribution scheduling (IPDS) problems. In such problems, order processing and delivery must be scheduled jointly in order to achieve an optimal balance between total operational costs and overall customer service. Offline IPDS problems, in which the information about every order is known in advance with certainty, are extensively studied. However, research on online IPDS problems, in which orders arrive randomly with their information unknown until they arrive, is relatively recent but is growing rapidly. In this talk, we first describe two real-world applications to illustrate the importance of studying online IPDS problems from a practical point of view, and highlight the challenges in deriving good algorithms for online IPDS problems. We then focus on one specific problem and analyze an online algorithm for the problem. Finally, we provide an overview of this problem area and discuss possible topics for future research. The next talk in our series will be: Thomas Lidbetter (Rutgers University) | June 4 | Min sum ordering problems with applications to scheduling For more details, please visit https://schedulingseminar.com/ With kind regards Zdenek Hanzalek, Michael Pinedo and Guohua Wan -- Zdenek Hanzalek Industrial Informatics Department, Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague, Jugoslavskych partyzanu 1580/3, 160 00 Prague 6, Czech Republic https://rtime.ciirc.cvut.cz/~hanzalek/
1 0
0 0
Rubing Chen (Zhengzhou University) | May 7 | Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion
by Zdenek Hanzalek 05 May '25

05 May '25
Dear scheduling researcher, We are delighted to announce the talk given by Rubing Chen (Zhengzhou University). The title is "Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion". The seminar will take place on Zoom on Wednesday, May 7 at 13:00 UTC. Join Zoom Meeting https://cesnet.zoom.us/j/95815007611?pwd=uA3Wt322MOaLW9M9F8M7UErCNPiZaw.1 Meeting ID: 958 1500 7611 Passcode: 629296 You can follow the seminar online or offline on our Youtube channel as well: https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A The abstract follows. In this talk, we consider the single-machine hierarchical scheduling problems with release dates and preemption, where the primary criterion is the total completion time and the secondary criterion is an arbitrarily regular scheduling criterion, which is of either the sum-form or the max-form. We aim to find a feasible preemptive schedule that minimizes the secondary criterion, subject to the condition that the primary criterion is minimized. We show that the variants of the problems under study are polynomially solvable. To address these problems, we establish some hereditary properties for the feasible schedules and instances, and present a complete description of the feasible schedules through some elaborately constructed job-permutations. The next talk in our series will be: Zhi-Long Chen (Univ of Maryland) | May 21 | Online Integrated Production and Distribution Scheduling For more details, please visit https://schedulingseminar.com/ With kind regards Zdenek Hanzalek, Michael Pinedo and Guohua Wan -- Zdenek Hanzalek Industrial Informatics Department, Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague, Jugoslavskych partyzanu 1580/3, 160 00 Prague 6, Czech Republic https://rtime.ciirc.cvut.cz/~hanzalek/
1 0
0 0

HyperKitty Powered by HyperKitty version 1.3.12.