200820119 九、發明說明： 【發明所屬之技術領域】 本發明涉及-種排程系統及方法，尤其係關於一種電 子看板之排程系統及方法。 【先前技術】 電子看板系統係採用光電顯示技術、電腦應用技術、 及自動㈣技術’針對顯示幕使用環境而專門設計之資訊 顯示系統。電子看板，又名多媒體傳播平臺， 多 體影音替代傳統平面文書公告與海報， = . 傳遞資訊到每個電子布告攔。 夕媒體電子看板系統同時可作 用多種影音訊源做多頻道輪人，^日實況轉播’並可使 八個影音輸入頻道，整套系統η母口伺服器最高可處理達 道，可透過中央播放排程系^^4可/1多達六十四個輸入頻 播放指定頻道之影音内容，最於1定地點之每個指定時間 場規劃，還可則艮輕易合商業看板及點對點之展 影院、車站等不同場合，及使用於超級市場、賣場、電 平臺等。 ^配冲時έ己錄系統作廣告播放 目前市場上之電子看板 用戶很滿意，其主要集中於^排私操作能力大多不係讓 排程之處理能力太弱，沒^二下一方面之問題：其一、對 法優先處理比較緊急之排程之優先順序，從而無 排程之基本資訊，從而使^戶其二、不能即時動態之更新 最近日期之梆程之基本資訊。無法直觀之、準確之瞭解到 其二、排程操作過於繁瑣， 6 200820119 舞法做到簡要而又有效之排程操作步驟。 【發明内容】 鐾於以上内容，有必要提出一種電子看板之排程系 統，其可以於指定客戶端電腦中動態之更新排程資訊，及 按照排程之優先等級順序來處理排程内容。200820119 IX. INSTRUCTIONS: TECHNICAL FIELD OF THE INVENTION The present invention relates to a scheduling system and method, and more particularly to an electronic kanban scheduling system and method. [Prior Art] The electronic signage system is an information display system specially designed for the environment in which the display screen is used, using photoelectric display technology, computer application technology, and automatic (four) technology. Electronic billboards, also known as multimedia communication platforms, multi-body audio and video replace traditional flat paper announcements and posters, = . Transfer information to each electronic bulletin board. The eve media electronic kanban system can also play a variety of audio and video sources to make multi-channel rounds, and the live broadcast of the day can make eight audio and video input channels. The whole system η female server can handle the channel at the highest level. The program system ^^4 can /1 up to sixty-four input frequencies to play the audio and video content of the specified channel, the most time-specific planning for each specified time field, but also the commercial kanban and peer-to-peer exhibition theater. Stations and other occasions, and used in supermarkets, stores, electric platforms, etc. ^With the rushing time, the system has been used for advertising. Currently, the electronic kanban users on the market are very satisfied. The main focus is on the operation of the private operation. Most of the processing power is not too weak, and the processing power of the scheduling is too weak. : First, prioritize the priority of the more urgent scheduling, so that there is no basic information of scheduling, so that the basic information of the latest date cannot be updated dynamically. It is impossible to understand intuitively and accurately. Secondly, the scheduling operation is too cumbersome. 6 200820119 The dance method is simple and effective. SUMMARY OF THE INVENTION In view of the above, it is necessary to propose an electronic signage scheduling system that can dynamically update scheduling information in a specified client computer and process scheduling content in accordance with the priority order of the scheduling.
鑒於以上内容，還有必要提出電子看板之排程方法， 其可以於指定客戶端電腦申動態之更新排程資訊，及按照 排程之等優先級順序來處理排程内容。 〜1計看板之排㈣統，該系統包括排程舰器、 貧料庫、中翻服n、客戶端電腦及顯示器。所述之排毛 舰器包括-馳處理馳，該排喊理模㈣於從客戶 端電腦中獲取客戶端電腦之IP位址，計算、調整及更新剩 =始時間及排程結束時間，動態創建每—天之排程資郭 糾㈣表，並將料之排程資鮮i表及排程内 所述之資料庫中’根據排程資訊列表中之胡 詩專級程度判斷排程資訊是否需要更 康 ==訊列表及排程内容列表於所述 器』 服器中下載查找到的排程内容，並將下ΐϊ 示於與該客戶端電腦相連接之顯示器上。 獲取每—台客戶端法’該方法包括如下步驟：(a 排程開始時間及排程結束時間，並葬(由)==計薦 始時間及排程結束時間 “2=件對排程房 延仃動L之调整及更新；（e)根據每 7 200820119 :天之排程資訊生成當天之排程 之排程内容摘要生成當天之排程内容列表，並 訊列表及排程内容列表存儲於資料庫中;In view of the above, it is also necessary to propose an electronic kanban scheduling method, which can specify the updated scheduling information of the client computer application dynamics, and process the scheduling content according to the priority order of scheduling. ~1 kanban platoon (four) system, the system includes scheduling vessels, poor storage, medium-turning n, client computers and displays. The arranging ship includes a Chichi processor, and the row shouting module (4) obtains an IP address of the client computer from the client computer, calculates, adjusts, and updates the remaining time and the schedule end time, and dynamically Create a schedule of each day's schedule, Guoqu (4), and report the schedule information in the database described in the schedule and the schedule of the Hu Shi grade in the schedule information list. Is it necessary to download the found schedule content in the server and the display list on the display connected to the client computer. Obtaining each client-client method's method includes the following steps: (a schedule start time and schedule end time, and funeral (by) == count start time and schedule end time "2 = piece to the scheduled room (e) Generate a list of schedule contents for the day based on the schedule content summary for each day of the 2008 20119: day schedule information, and list the list and schedule contents in the list. In the database;
::二級程度判斷排程資訊是否需要更新;⑷排程的‘先 ^序荨級程度發生變化，則更新所述之排程資訊列表中之 排程貧訊及排程内容列表中之排程内容财；及(彻虞所 1程㈣縣及難”縣於巾蘭服时 ==内容，並㈣具㈣應Ip位址之客戶端電腦; 繼舰器中下載查找到之排程内容，並顯示於 述之客戶端電腦相連接之顯示器上。 一 :較于習知技術’所述之電子看板之排程系統及方 ㈣Γ可以於指定客戶端電腦中動態之更新排程資訊，及 按π排程之優先等級順序來處理排程内容。 【實施方式】 參照圖1所示’係本發明電子看板之排程系統較佳每 施例^系統架構圖。該系統主要包括—台排程伺服器^ 么個貝料庫2、多台中繼伺服器3、多台客戶端電腦*及多 台顯示器5。所述之排程伺服器}藉由連接12與所述之資 料庫2相連接’並藉由網路14與所述之客戶端電腦4相連 ，。所述之中繼伺服器3與排程伺服器丄直接相連接，並 藉由網路14與所述之客戶端電腦4相連接。所述之客戶= 電腦4可以直接連接一台顯示器5，也可以藉由一個分配 器40連接多台顯示器5。 所述之排程伺服器1包括一排程處理模組1〇,該排程 8 2〇〇82〇li9 ^理拉組10用於從客戶端電腦4中獲取每一台客戶端電腦 4之IP位址，計算排程開始時間及排程結束時間，動態創 建每一天之排程資訊列表21及排程内容列表22，旅將所 ，之排％資訊列表21及排裎内容列表22存儲於所述之資 $庫2中，根據排私優先噸序等級程度判斷排程資訊是否 而要更新，根據所述之排程資訊列表^及排程内容列表 22於所述之中繼祠服器3中查找對應之排程内容，及控制 _ 具有對應1Ρ位址之客戶端電腦4直接從所述之中繼伺服器 3中下載查制的排，並將下載之排程内容顯示於 與該客戶端電腦4相連接之顯示器上。所述之排程資訊包 括排程編號、排程名稱、排程日期、排程時間、客戶端位 址及排程優先順序等貧訊（詳細描述請參照圖3所示）。所 述之排程内容摘要包括檔案編號、檔案名稱、檔案類型及 排程編號（詳細描述請參照圖4所示）。所述之排程優先順 序係標不某一個排程之優先等級程度，本實施方式中，採 •用A 、B 、C’及“D”四種排程優先順序，並 定義上述四種排程優先順序等級依次降低，即排程優先等 級順序爲：A>B>C>D。 所述之資料庫2用於存儲所述之排程資訊列表21 排程内容列表22。每-台巾繼錬器、3包括—個記伊 30,用於存儲可供客戶端電腦4下載之排程内容。所述 排程内容爲可供客戶端電腦4下載並播放之播案，例如 案臟卜㈣、™63、···、^，主要包括電影、音芈 動畫及新_職_。每-台客戶端電腦4都且有一, 9 200820119:: Level 2 determines whether the schedule information needs to be updated; (4) The schedule of the schedule has changed, and the row in the schedule information list and the schedule content list in the schedule information list are updated. Cheng content finance; and (completely the 1st (four) county and difficult" county in the towel service == content, and (4) with (four) the client computer at the Ip address; download the found content in the successor And displayed on the display connected to the client computer. A: The electronic kanban scheduling system and the party (4) described in the prior art can dynamically update the scheduling information in the specified client computer, and According to the order of priority of π scheduling, the scheduling content is processed. [Embodiment] Referring to FIG. 1 , the scheduling system of the electronic kanban of the present invention is preferably a system architecture diagram. The system mainly includes a platform. The server 2, the plurality of relay servers 3, the plurality of client computers*, and the plurality of displays 5. The scheduling server is connected to the database 2 by the connection 12 Connected' and connected to the client computer 4 via the network 14, said The server 3 is directly connected to the scheduling server , and is connected to the client computer 4 via the network 14. The client=computer 4 can be directly connected to a display 5, or by A distributor 40 is connected to a plurality of displays 5. The scheduling server 1 includes a scheduling processing module 1 〇, the scheduling 8 2 〇〇 82 〇 li9 ^ TL group 10 is used for the client computer 4 Obtain the IP address of each client computer 4, calculate the schedule start time and the schedule end time, dynamically create a schedule information list 21 and a schedule content list 22 for each day, and the travel information, the row information The list 21 and the content list 22 are stored in the capital account 2, and the scheduling information is updated according to the level of the priority of the privilege priority order, according to the schedule information list and the schedule content list. Searching for the corresponding schedule content in the relay server 3, and controlling the client computer 4 having the corresponding address to download the searched row directly from the relay server 3, and Displaying the downloaded schedule content on the display connected to the client computer 4 The scheduling information includes schedule number, schedule name, schedule date, schedule time, client address and schedule priority, etc. (refer to Figure 3 for details). The summary of the schedule content includes the file number, the file name, the file type, and the schedule number (refer to FIG. 4 for detailed description). The scheduling priority is not the priority level of a certain schedule, and the embodiment is In the middle, the A, B, C', and "D" scheduling priorities are used, and the above four scheduling priority levels are defined to be sequentially decreased, that is, the scheduling priority order is: A>B>C>D The database 2 is used to store the schedule information list 21 schedule content list 22. Each of the desk towels, 3 includes a note 30 for storage for the client computer 4 to download. Schedule content. The scheduled content is a broadcast that can be downloaded and played by the client computer 4, such as the dirty (4), TM63, ..., ^, mainly including movies, audio animations and new _ jobs. Every client computer 4 has one, 9 200820119
唯一確定之ip位址，例如IP1、IP2、IP3、…、ΙΡιι，該IP 位址係該台客戶端電腦4之目之位址。所述之客戶端電腦 4可以係一般用戶之電腦，例如臺式機或手提電腦，還可 以係任意其他適用之電腦等。所述之顯示器5可以係CRT 顯不器、LCD顯示器，或任意其他適用之顯示裝置。所述 之連接12爲一種資料庫連接，如開放式資料庫連接（〇pen Database Connectivity，0DBC)，或 了謂資料庫連接（java Database Connectivity ’ JDBC )等。所述之網路 14 可以係 企業内部網（Intranet)，也可以係國際互聯網（Internet) 或其他類型之通訊網路。 參照圖2所示，係排程處理模組1〇之功能模組圖。 所述之排程處理模組10包括排程位址獲取子模組ι〇ι、排 耘時間汁异子模組1〇2、排程列表生成子模組1〇3、排程資 訊更新子模組104及排程内容下載子模組1〇5。 /斤，之排程位址獲取子模組1〇1用於從客戶端電腦4 中獲取每-台客戶端電腦4之1?位址。每—台客戶端電腦 4都具有一個唯一確定之汗位址，例如ιρι、ιρ2、ιρ3、…、 IPn ’該IP位址係該台客戶端電腦4之目之位址。 所述之排程時間計算子模組1〇2用於藉由預先定義之 時間組件计异排程開始時間及排程結束時間，並藉由預先 疋義之日期組件對排程開始時間及排程結束時間進行動態 之調整及更新。所述之時間組件包括semue組件、如心 組件及setListDate組件；所述之日期組件包括 setSelectDate 組件及 update 組件等。 200820119 •所述之排程列表生成子模組ι〇3用於根據每一天之排 程貧訊生成當天之排程資訊列表21，及根據每〆天之排程 内谷摘要生成當天之排程内容列表22,並將該排程資訊列 表21及排私内容列表22存儲於資料庫2中。所述之排程 資訊包括排程編號、排程名稱、排程日期、排程時間、客 戶端位址及排程優先轉等資訊。所述之排程内容摘要包 括檔案職、檔案名稱、檔案類型及排程編號。The only ip address that is determined, such as IP1, IP2, IP3, ..., ΙΡιι, is the IP address of the client computer 4. The client computer 4 can be a general user's computer, such as a desktop or a laptop computer, and can be any other suitable computer. The display 5 can be a CRT display, an LCD display, or any other suitable display device. The connection 12 is a database connection, such as an open database connection (0DBC), or a Java database Connectivity (JDBC) connection. The network 14 can be an intranet or an Internet or other type of communication network. Referring to FIG. 2, it is a functional module diagram of the scheduling processing module. The scheduling processing module 10 includes a scheduling address acquisition sub-module ι〇ι, a drainage time juice hetero-sub-module 1 〇 2, a scheduling list generation sub-module 1 〇 3, a scheduling information updater The module 104 and the scheduling content download sub-module 1〇5. / jin, the scheduling address acquisition sub-module 1 〇 1 is used to obtain the 1st address of each client computer 4 from the client computer 4. Each client computer 4 has a uniquely determined sweat address, such as ιρι, ιρ2, ιρ3, ..., IPn'. The IP address is the destination address of the client computer 4. The scheduling time calculation sub-module 1 用于 2 is used for pre-scheduled start time and schedule end time by a predefined time component, and schedule start time and schedule by pre-deprecated date component The end time is dynamically adjusted and updated. The time component includes a semue component, a heart component, and a setListDate component; the date component includes a setSelectDate component and an update component. 200820119 • The schedule generation sub-module ι〇3 is used to generate the schedule information list 21 of the day according to the schedule of each day of the schedule, and generate the schedule of the day according to the valley summary of each day of the schedule. The content list 22 stores the schedule information list 21 and the private content list 22 in the database 2. The schedule information includes schedule number, schedule name, schedule date, schedule time, client address, and schedule priority. The summary of the scheduled content includes the archive job title, the file name, the file type, and the schedule number.
所，之㈣資訊更新子触用練據排程優先順 次錄度來列斷排程資訊是否需要更新，若需要更新排 六資貝^排長資訊列表21中更新排程資訊及於排程内 奋列表22中更新排程内容摘要。本實施例中，採肖“A”、 “B” 、 “C；，， “ ” 〇 a 及“D”四種排程優先順序來標示某一個排 私之U等級程度，並定義上述四種排程優先等級依次降 低即排辛王優先等級順序爲：A>B>C>D。若排程優先順序 順序發生變化，則說明排程資訊需要更新。 一所述之拂程内容下載子模組105用於根據所述之排程 資訊列表21及排程内容列表22於中繼伺服器3中查找所 而排耘内谷’並控制具有對應IP位址之客戶端電腦4從所 述之中繼伺服H 3中下载查找到的排程内容。所述之排程 内奋存儲於所述中繼伺服器3之記憶體30中，其爲/種可 ^客戶端電腦4巾減之檔案，減案種類主要包括電 u曰樂、動晝及新聞等内容。 參照圖3所示，係排程資訊列表21之示意圖。所述 之排程貢訊列4 21巾之排程資訊包括排程編㉟、排程名 11 200820119 ♦ ♦ 今、排程開料間、排程結束時間、客戶端位址、及排程 優先順序。每-個排程都對應一個唯一之排程編號來表示 不同之排程，例如ID1、ID1、ID3、ID4、...、IDn。所述 之排程名稱包括電影、新聞、音樂及動晝等。每一個排程 都需經過所述之排程時間計算子模組搬計算出一個排程 時間，其包括排程開始時間及排程結束時間，例如2〇〇6 年10月8日、星期日、上午8:0〇爲排程編號ID2之排程 驗開始呀間，而上午1〇:〇〇爲排程編號出2之排程結束時間。 所述之客戶端位址係標示客戶端電腦4之抒位址，例如 IP1、IP2、IP3、...、IPn，其由排程位址獲取子模組1〇1 從每一台客戶端電腦4獲取。所述之排程優先順序係標示 某一個排程之優先等級程度，於本實施方式中，採用 A 、 B” 、“C”及“D”四種排程優先順序來定義 排程之優先等級程度，上述四種排程優先等級依次降低， 即：A>B>C>D 〇 • 參照圖4所示，係排程内容列表22之示意圖。所述 之排程内容列表22中之排程内容摘要包括檔案編號、檔案 名稱、檔案類型及排程編號。每一個檔案都對應有一個檔 案編號，例如PI、P2、P3、P4、…、pn。每一個檔案都有 一個唯一之檔案名，例如 Filel、File2、File3、File4、…、 Fileii。所述之檔案類型係用於區分每一個檔案種類，例如 構案種類係電影之檔案類型爲mov，檔案種類係新聞之檔 案類型爲avi，檔案種類係音樂之檔案類型爲mp3或mp4 等’及檔案種類係動畫之檔案類型爲MPEG等。所述之排 12 200820119 ，編號與所述之排程資訊列表21中之排程編號相同，其將 .排程資訊 21與排程内容列表22相關聯，以便於/中繼 • 祠服器3巾之記憶體30查找到對應之排程内容。 參照圖5所示，係本發明電子看板之排程方法較佳實 施例之實施流程®。排程處理模組1()裝载於排程伺服器工 中，並運行於排程伺服器i中。首先，排程位址獲取子模 組101獲取每一台客戶端電腦4之IP位址，該IP位址用 •於標=該台客戶端電腦4之目之位址（步驟S5〇)。排程時 間計算子模組102藉由預先定義之時間組件（例如此丨卩… 組件、setList組件及setListDate組件）計算出排程開始時 間及排程結束時間，並藉由日期組件（例如setSelectDate 組件及update組件）對排程開始時間及排程結束時間進行 動態之調整及更新（步驟S51)。 排程列表生成子模組103根據每一天之排程資訊生成 當天之排程資訊列表21，及根據每一天之排程内容摘要生 _ 成當天之排程内容列表22，並將該排程資訊列表21及排 程内谷列表22存儲於資料庫2中。所述之排程資訊包括排 私編號、排程名稱、排程日期、排程時間、客戶端位址及 排程優先順序等資訊。所述之排程内容摘要包括檔案編 號、檔案名稱、檔案類型及排程編號（步驟S52)。 排程資訊更新子模組104根據排程資訊更新所述之排 程資訊列表21中之排程資訊，及根據排程内容摘要更新所 述之排程内容列表22中之排程内容摘要（步驟S53)。排 程資訊更新子模組104根據排程優先順序等級程度判斷排 13 200820119 _ 鲁 _資訊是否需要更新，若排程排程優先順序料發 化，則說明排程資訊需要更新（步驟S54)。若^交 程資訊，則於排程資訊列表21中更新排”^及^ .内容列表22中更新排程内容摘要，即返回步驟奶。' ^ 需要更新排程資訊，則排程内容下載子模組ι〇5根= 之排程貝刻表21及排㈣容麻22於巾繼他哭 記憶體30中域所料如容，並根據客腦。 Π> 4立址控制述之客戶端電腦4直接從所述 之 中下載查找到的排程内容（步 …體30(4) The information update sub-practices the priority of the schedule to check whether the schedule information needs to be updated. If it is necessary to update the schedule information in the list 6 and update the schedule information and within the schedule The summary of the schedule content is updated in the list 22. In this embodiment, the four scheduling priorities of "A", "B", "C;," "" 〇a and "D" are used to indicate the degree of U level of a certain private privilege, and the above four types are defined. The scheduling priority level is lowered in turn, that is, the ranking order of the rankings is: A>B>C>D. If the scheduling priority order changes, the scheduling information needs to be updated. The group 105 is configured to search the relay server 3 according to the scheduled information list 21 and the scheduled content list 22, and control the client computer 4 having the corresponding IP address from the The searched schedule content is downloaded from the relay servo H3. The schedule is stored in the memory 30 of the relay server 3, which is a file of the client computer 4 The types of the reduction cases mainly include the contents of the electricity, music, and news. Referring to Figure 3, there is a schematic diagram of the schedule information list 21. The schedule information of the schedule of the tribute is 4 Cheng 35, schedule name 11 200820119 ♦ ♦ Today, scheduling opening, scheduling end time, The client address and the scheduling priority. Each schedule corresponds to a unique schedule number to indicate different schedules, such as ID1, ID1, ID3, ID4, ..., IDn. The name of the program includes movies, news, music, animation, etc. Each schedule needs to calculate a schedule time through the schedule calculation sub-module, which includes the schedule start time and the schedule end time. For example, on October 8, 2, 6th, Sunday, 8:00 am, the schedule number ID2 is scheduled to start, and the morning is 1〇: 〇〇 is the schedule number 2 and the schedule end time. The client address indicates the address of the client computer 4, such as IP1, IP2, IP3, ..., IPn, which is obtained by the scheduling address sub-module 1〇1 from each client. The computer 4 obtains the scheduling priority, which indicates the priority level of a certain scheduling. In the embodiment, the scheduling order is defined by using four scheduling priorities A, B", "C" and "D". The degree of priority of the process, the above four scheduling priority levels are reduced in turn, namely: A > B > C > D 〇 • ginseng As shown in FIG. 4, line 22 showing contents of the schedule list. The schedule content summary in the scheduled content list 22 includes a file number, a file name, a file type, and a schedule number. Each file corresponds to a file number, such as PI, P2, P3, P4, ..., pn. Each file has a unique file name, such as Filel, File2, File3, File4, ..., Fileii. The file type is used to distinguish each file type. For example, the file type is mov, the file type is avi, the file type is mp3 or mp4, and the file type is mp3 or mp4. The file type is an animation file type of MPEG. The row 12 200820119 has the same number as the schedule number in the schedule information list 21, and associates the schedule information 21 with the schedule content list 22 to facilitate/relay the server 3 The memory 30 of the towel finds the corresponding scheduled content. Referring to Fig. 5, it is an implementation flow of a preferred embodiment of the scheduling method of the electronic signage of the present invention. The scheduling processing module 1 () is loaded in the scheduling server and runs in the scheduling server i. First, the scheduling address acquisition submodule group 101 obtains the IP address of each client computer 4, and the IP address is used to mark the destination address of the client computer 4 (step S5). The schedule time calculation sub-module 102 calculates the schedule start time and the schedule end time by pre-defined time components (for example, the component, the setList component, and the setListDate component), and the date component (for example, the setSelectDate component) And the update component) dynamically adjusts and updates the schedule start time and the schedule end time (step S51). The schedule list generation sub-module 103 generates a schedule information list 21 for the day according to the schedule information of each day, and summarizes the scheduled content list 22 of the day according to the schedule content of each day, and the schedule information is obtained. The list 21 and the schedule inner valley list 22 are stored in the database 2. The schedule information includes information such as a private number, a schedule name, a schedule date, a schedule time, a client address, and a schedule priority. The summary of the scheduled content includes an archive number, a file name, a file type, and a schedule number (step S52). The schedule information update sub-module 104 updates the schedule information in the schedule information list 21 according to the schedule information, and updates the schedule content summary in the schedule content list 22 according to the schedule content summary (step S53). The schedule information update sub-module 104 judges whether the schedule needs to be updated according to the level of the schedule priority level. If the schedule schedule priority is scheduled, the schedule information needs to be updated (step S54). If the intersection information is updated, the row "^ and ^" are updated in the schedule information list 21. The schedule content summary is updated in the content list 22, that is, the process returns to the step milk. ' ^ Need to update the schedule information, then the schedule content downloader The module ι〇5 = the schedule of the shell table 21 and the row (four) Rong Ma 22 in the towel after his crying memory 30 in the domain, and according to the guest brain. Π > 4 location control client The computer 4 downloads the found schedule content directly from the middle (step... body 30
從所述之記憶體30中下載之客戶W 3 ^ 下載之排程内容，並將播放之排程内 該客戶端電腦4相連接之顯示器5上（步驟 本發明雖以較佳實施方式揭露如上，铁並並非用㈣ =。Γ熟悉此項技藝者，在不脫離本發明之㈣ 視後附之申明專利乾圍所界定者為準。 【圖式簡單說明】 架構^係本發明電子看板之排程系统較佳實施例之系統 圖：;中之排程處理模 圖3係圖1中之排程資訊列表 圖4係圖1中之排程内容列表之圖。 圖5係本糾f子看板 =圖。 流程圖。 紅方去較佳實施例之實施 200820119 【主要元件符號說明】 排程伺服器 1 排程處理模組 10 排程位址獲取子模組 101 排程時間計算子模組 102 排程列表生成子模組 103 排程資訊更新子模組 104 排程内容下載子模組 105 ®連接 12 網路 14 資料庫 2 排程資訊列表 21 排程内容列表 22 中繼伺服器 3 記憶體 30 φ 客戶端電腦 4 分配器 40 顯示器 5 15The client W 3 ^ downloaded from the memory 30 downloads the scheduled content, and the playback schedule is displayed on the display 5 to which the client computer 4 is connected (steps of the present invention are disclosed in the preferred embodiment as above , iron does not use (four) =. Γ familiar with the art, without departing from the definition of the patent (4) attached to the invention, which is defined by the patent stipulations. [Simplified description] Architecture ^ is the electronic kanban of the present invention The system diagram of the preferred embodiment of the scheduling system:; the scheduling processing model in FIG. 3 is the scheduling information list in FIG. 1. FIG. 4 is a diagram of the scheduling content list in FIG. 1. FIG. 5 is a diagram of the scheduling content. Kanban = Fig. Flowchart. Red to the implementation of the preferred embodiment 200820119 [Main component symbol description] Scheduler 1 Scheduling module 10 Scheduled address acquisition sub-module 101 Scheduling time calculation sub-module 102 Schedule List Generation Sub-module 103 Schedule Information Update Sub-module 104 Schedule Content Download Sub-Module 105 ® Connection 12 Network 14 Database 2 Schedule Information List 21 Schedule Content List 22 Relay Server 3 Memory Body 30 φ client computer 4 distributor 40 display Is 515