JP2006285784A - Scheduling system and method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To efficiently and accurately make a schedule for both of a device and a worker by interlocking the schedule of the worker and the schedule for the device. <P>SOLUTION: A job is accepted, and an occupied time for a device including a usage period for a device managed by a device schedule part and a manual work period by a worker is calculated (S1202). From the working hours of the worker managed by an operator scheduler and the occupied time for the device, the number of worker who can work in a predetermined time zone is calculated (S1207, S1204). From the manual work period included in the occupied time for the one or more devices, the number of duplicated manual tasks in the predetermined time zone is calculated (S1207, S1204). According to the number of workers and the number of duplicated manual tasks, the usage period of the device is shifted (S1204, S1205). According to the usage period for the device assigned by the device schedule part, the number of workers and the number of duplicated manual tasks, the working hours of the worker are updated (S1207, S1211). <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to a scheduling system and method, and more particularly, to a scheduling system, method, and program in a printing system that executes a printing process.

  In commercial printing, a request for creation of printed matter (magazine, newspaper, catalog, advertisement, gravure, etc.) is received from a third party (customer, client), and the desired printed matter for that client is created and delivered to that client. To get rewards from clients. Conventionally, in such a commercial printing industry, it is still mainstream to use a large-scale printing apparatus such as an offset plate-making printing machine. The printing industry has been working through various processes. These processes include submission, design and layout, comprehensive (printer output presentation), proofreading (layout correction and color correction), proof printing (proof print), composition creation, printing, post-processing, shipping, etc. It is. In order to use the printing press as described above, it is indispensable to make a block copy. Once a block copy is formed, the correction is not easy and is very disadvantageous in terms of cost. For this reason, the above-described steps are caused by careful calibration, that is, layout check and color confirmation work are essential. As described above, in this industry, a large-scale apparatus is required, and a certain amount of time is required for a client to create a desired printed matter. Moreover, each of these operations requires specialized knowledge, so to speak, it requires the know-how of a skilled worker called a craftsman.

  On the other hand, recently, with the increase in speed and image quality of electrophotographic printing apparatuses and ink jet printing apparatuses, the print on demand (hereinafter referred to as Print On Demand) is described below. A market called POD) is also emerging. POD aims to handle a job with a relatively small lot compared to a job handled by a printing apparatus with a short delivery time without using a large-scale apparatus or system. That is, POD uses digital image forming apparatuses such as digital copiers and digital multi-function machines to the maximum, instead of the large-scale printing machines and printing methods as described above, and digital printing using electronic data. Is realized. In such a POD market, digitization is more integrated than in the conventional printing industry, and management and control using a computer have permeated. The computer is used to approach the level of the printing industry to some extent. Against this background, the POD market includes PFP (Print For Pay), which is called a printing service of a copy / print shop printing company, and CRD (Centralized Reproduction Division), which is called an in-house printing service. Exists.

  In the printing industry and the POD market as described above, there is also a service that collectively handles all operations from receiving and placing orders for products to packing, delivery, after-sales service, inventory management, payment management, etc. It is being offered. However, it still has room for consideration.

  In the printing industry and POD market as described above, management plans and management operations can be supported through the collection, processing, and reporting of production-related data, information can be accumulated, and provided to necessary departments when necessary. Systems that can do this are also being considered. However, the reality is that the optimal system has not yet been realized and operated.

  In addition, in the POD market as described above, it is currently impossible to employ workers as skilled as in the conventional printing industry, and it is desirable to complete jobs at low cost, to conduct business with less investment, TCO (Total Cost) There is also a demand for reduction of “Ownership”. However, because POD is not yet able to fully meet such demands because of the new market, there are still problems to be solved.

  In the POD system as described above, a system that performs optimal scheduling of operators and devices (printing apparatuses) in response to orders for printed materials is used as in the case of conventional printing systems.

  In a work mode such as POD in which operations (manual work) of a plurality of devices are processed in parallel, it is necessary to optimize both an operator schedule (working time assignment) and a job assignment schedule to devices.

  In a work mode such as POD, a manual operation by an operator is inserted between automatic processes by a device, so one operator is not necessarily required for one device. However, do not interrupt the job assigned to the device when the timing of manual operations overlaps or when the operator takes time to move from device (job) to device (job) (when space is large) For this reason, a plurality of operators may be required.

  Here, as a conventional technique, there is a technique for shifting an allocation period among a plurality of jobs so that a manual operation period of a specific operator does not overlap. Thereby, efficient job scheduling can be performed without arranging many operators according to the number of devices. However, since scheduling is targeted at a predetermined operator, optimal scheduling is not always possible. In this example, when scheduling cannot be performed well, an error is notified and the person in charge of scheduling is notified (see Patent Document 1).

  As another conventional technique, there is a technique for performing scheduling in consideration of a worker's schedule, skill level, and working hours. This makes it possible to efficiently schedule jobs according to the operator's schedule (see Patent Document 2).

Japanese Patent Laid-Open No. 10-244447 JP 7-319338 A

  Considering operator labor costs, it is necessary to create an operator schedule with as few people as possible. On the other hand, in order to increase the operation rate of the device or to keep the delivery date, it is necessary to create an operator schedule with a margin. Furthermore, in order to perform an accurate job schedule, it is necessary to optimize the schedule in consideration of the manual work period performed by the operator in the job schedule assigned to the device.

  However, in the examples of Patent Document 1 and Patent Document 2, if device assignment of jobs is performed according to a predetermined operator schedule, when many jobs are requested, the duplication of manual work periods will eventually occur. Inevitable. For this reason, there is a possibility that the job execution according to the schedule may not be performed. As a result, the prior art has problems to be solved, such as the deadline cannot be met, the schedule estimation of the subsequent job becomes more inaccurate (the accurate deadline cannot be calculated), and the inefficiency (there is a time when the device and the operator are idle). There was. Further, the prior art has a problem to be solved that it is not possible to receive an order for a rush job or the like ignoring the operator schedule.

  The present invention has been made in view of such a problem, and an object of the present invention is to perform efficient and accurate scheduling in both the worker and the device by linking the worker schedule and the device schedule. It is to provide a scheduling system and method.

  In order to achieve such an object, the scheduling system of the present invention manages the schedule of one or more workers who use the device and the device in a printing system including one or more devices that require manual work. A scheduling system (103) for receiving a print job, a job receiving unit (S1202) for receiving a print job, an operator schedule unit (202) for managing the working time of the worker, and a usage time of the device in association with the print job. Device scheduling means (203) for managing the device, and an occupation period calculation means (FIG. 7) for calculating the occupation time of the equipment including the manual work period by the worker in the usage time of the equipment managed by the device scheduling means. ) And the work of the worker managed by the operator schedule means And the number of workers capable of working in a predetermined time zone from the occupation time of the device (S1207, S1204), and the manual operation period included in the occupation time of one or more of the devices A duplicate manual operation number calculation means (S1207, S1204) for calculating the number of duplicate manual operations in a predetermined time period, and a device use time shift means for shifting the use time of the device according to the number of workers and the number of duplicate manual operations ( S1204, S1205), an operator rescheduling unit (S1207 to S1211) that updates the working time of the worker according to the usage time of the device allocated by the device scheduling unit, the number of workers, and the number of duplicate manual operations. ).

  In order to achieve the above object, the scheduling method of the present invention manages the device and the schedule of one or more workers who use the device in a printing system including one or more devices that require manual work. A scheduling method for a scheduling system, comprising: an operator scheduling means for managing the working time of the worker; and a device scheduling means for managing a usage time of the equipment in association with the print job. A job accepting step for accepting a print job by the job accepting means; and an occupation time of the device including a manual work period by the operator in the usage time of the device managed by the device scheduling means by the occupation period calculating means. Occupancy period calculation step to calculate A worker number calculating step for calculating the number of workers capable of working in a predetermined time zone from the worker working time managed by the operator scheduling means and the occupation time of the equipment by the worker number calculating means; Duplicate manual operation number calculating step for calculating the number of duplicate manual operations in a predetermined time zone from the manual operation period included in the occupation time of one or more of the devices by the duplicate manual operation number calculating device, and device usage time shifting means The device utilization time shifting means for shifting the utilization time of the device according to the number of workers and the number of duplicate manual operations, the utilization time of the device allocated by the device scheduling means by an operator rescheduling means, and the work An operator reschedule step that updates the work time of the worker according to the number of workers and the number of duplicate manual tasks. Characterized in that it comprises a flop.

  With the above configuration, the device is scheduled, and duplication of the manual work of the worker is appropriately avoided at that time, and the schedule result of the device is reflected in the worker's schedule.

  In addition, embodiment corresponding to the structure of a claim was shown by (). However, the constituent elements described in the claims are not limited to the constituent elements in the embodiment of the above () part.

  According to the present invention, it is possible to efficiently link the worker's schedule and the device's schedule and to perform efficient and accurate scheduling for both the device and the worker.

  Embodiments to which the present invention can be applied will be described below in detail with reference to the drawings. In addition, in each drawing referred in this specification, the same code | symbol is attached | subjected to the location which has the same function.

First Embodiment Hereinafter, a first embodiment of the present invention will be described in detail with reference to the drawings.

(Device configuration)
FIG. 1 is a block diagram illustrating an example of a basic configuration of the entire printing system. The printing system includes one or a plurality of end user environments and a POD (Print On Demand) site environment connected via the Internet.

  In the end user environment, there is an orderer who makes a print order request. Using each client PC from each end user environment (here, end user environment A and end user environment B), it is possible to check a job status including a print job request.

  On the other hand, the POD site environment is composed of four process parts, a process management part 101, a prepress part, a digital print part, and a post press part.

  The process management unit 101 is a part for instructing work to each process of the prepress unit, the digital print unit, and the post press unit in the POD site environment, and centrally managing the workflow of this system constituted by computers and various devices. is there. The process management unit 101 receives a job from the end user described above, stores the job from the end user, and assembles the work in each process as a workflow based on the job designation from the end user. And the process management part 101 schedules the work in each device or each worker efficiently.

  The prepress unit scans a paper document received from the end user using a scan device such as a scanner / MFP (Multi Function Peripheral) based on the work instruction of the prepress job received from the process management unit. The prepress unit captures the scanned image file into the prepress server or the client PC, and executes image correction, file merging, page insertion / deletion, various page layout editing, and imposition processing. Further, the prepress unit executes proof output for confirming the layout and color of the final product as necessary.

  The digital print unit copies a paper document received from the end user by a monochrome MFP, a color MFP, or the like in accordance with a print job work instruction received from the process management unit or the prepress unit. In addition, the digital print unit prints a document / image file received from an end user from a client PC via a printer driver or a hot folder, a scanned image file scanned by a scanning device, and a document / image file edited by a monochrome MFP. Or print out to a printing device such as a color MFP.

  The post-press section follows the work instructions of the post-press job received from the process management section, pre-press section, or digital print section, after the paper folding machine, saddle stitch binding machine, case binding machine, cutting machine, sealing machine, book binding machine, etc. Control the processing device. Further, the post press section performs finishing processes such as paper folding, saddle stitch binding, case binding, cutting, enclosing, and registering on the recording paper output from the digital printing section.

  FIG. 2 is a block diagram illustrating an example of the configuration of the process management unit 101. The process management unit includes a MIS (Management Information System) server connected to a network, an order receiving server 103, a file server, and a client PC 101 which is a client machine of these servers.

  Here, the MIS server is a server in a system that manages the workflow of the entire system from order receipt to delivery and comprehensively manages various management information and sales information.

  The order receiving server is a server that receives a job from an end user environment using the Internet. The received job is managed by the ID number of the job, the ID number and information necessary for management are transmitted to the MIS server, and other information such as image data is sent to the downstream process together according to the instruction of the MIS server. Tell.

  The file server is a document management server for storing jobs received from the end user in preparation for reordering with the same manuscript from the end user. Generally, image data and job setting information (job ticket) at the time of previous output are stored together.

  Information exchanged between the MIS server, order receiving server, file server, and client PC in the process management unit is exchanged using a job ticket that describes job instructions called JDF (Job Definition Format). The Jobs are transferred, control commands are issued, and the pre-press part, digital print part, and post-press part, with a focus on the process management part, provide total workflow automation.

  The order receiving server 103 of the process management unit assigns a device corresponding to the received job, but also performs an operator's schedule management for performing the manual work required for the operation of various devices. The operator and device schedules are managed by a printer who maintains the POD site environment using an operator schedule management application and a device schedule management application installed in the order receiving server 103.

  FIG. 3 is a diagram showing an example of a management screen configuration (setting screen for an operator schedule management application) for the printer to manage an operator (worker) schedule displayed on the client PC 102 communicating with the order receiving server 103. It is.

  Menus such as “file” “operator” “display” “schedule” “tool” “help” are arranged on the upper side of the setting screen of the operator schedule management application. The operator selects these menus and executes various processes in the operator schedule management application.

  The calendar arranged at the upper left of the screen is for selecting the display range of the schedule to be displayed. In the example of this screen, one week including 2003/12/16 is selected.

  In the “worker information”, information on the selected operator such as “name”, “position”, “location”, “overtime overtime”, “comment”, and the like is displayed.

  The “weekly” tab and the “monthly” tab display a weekly schedule and a monthly schedule, respectively, and a rectangular area of a time zone in which the operator works is displayed as a schedule of the reserved operator.

  The example of this screen shows a case where the area of worker A of 2003/12/16 is selected and information of the worker named “worker A” is displayed. In addition, a weekly schedule of “worker A”, “worker B”, “worker C”, and “worker D” is displayed.

  FIG. 4 is a view showing an example of a management screen configuration (display screen of a device schedule management application) for the operator to manage the device allocation schedule of the ordering order displayed on the client PC 102 communicating with the order receiving server 103. is there.

  Menus such as “file” “device” “display” “schedule” “tool” “help” are arranged on the upper side of the setting screen of the device schedule management application. The operator selects these menus and executes various processes in the device schedule management application. Since the order receiving server automatically assigns devices to orders, the device schedule management application basically only checks the device schedule and the corresponding operator assignment.

The calendar arranged at the upper left of the screen is for selecting the date of the schedule to be displayed. In the example of this screen, 2003/12/16 is selected.
In “device information”, information on devices used in the selected reservation such as “name”, “type”, “location”, “speed”, and “comment” is displayed.

  In the “reservation information”, reservation information in the selected reservation such as “subject”, “type”, “date”, “time”, “worker”, and “comment” is displayed.

  The “daily” and “weekly” tabs display a daily schedule and a weekly schedule, respectively. As reserved schedules, the subject of the reservation and the operator in the rectangular area of the applicable time zone of the device used Information on manual work timing and period is displayed. The period of the area indicated by “O” in the rectangular area is the period during which the operator performs manual work.

  The example of this screen shows a case where the reservation of the subject “manual reprint” in the time zone “10: 00-12: 00” in the “monochrome printer” named “B” is selected. Furthermore, it is shown that the operators who perform the manual work related to the reservation are the worker C and the worker A.

  FIG. 5 is a block diagram showing a configuration example of a system (order receiving server 103) relating to scheduling of operators and devices in the present embodiment. In FIG. 5, reference numeral 200 denotes an occupancy time calculation unit that calculates a device selection and occupancy time from an ordered job, and 201 denotes a device information database used in the occupancy time calculation unit 200. 202 is an operator scheduler, 203 is a device schedule unit for automatically assigning devices, and 204 is a device schedule display unit. Reference numeral 205 denotes an operator rescheduling unit that makes a reschedule reservation for the operator scheduler 202 when an operator reschedule occurs in the device scheduling unit 203.

  Here, 202 corresponds to the user interface application shown in FIG. 3, and 204 corresponds to the user interface application shown in FIG.

(Description of operation)
FIG. 6 is a diagram showing an example of the data structure of the operator schedule held in the operator scheduler 202 in FIG. 5 and displayed as shown in FIG.

  The arrangement structure shown on the left in FIG. 6 is the main structure of the operator schedule data and serves as an entrance when referring to the operator schedule. In FIG. 6, only a part of the arrangement is shown for the purpose of explanation. In the figure, reference numeral 300 denotes an operator schedule dated 2003/12/15, 301 denotes 2003/12/16, and 302 denotes 2003/12/17. Shows date data. The detailed data structure in the date unit of 2003/12/17 is omitted.

  In addition, the individual data structure shown on the right in FIG. 6 is a data structure that holds information regarding each worker. In FIG. 6, since the purpose is to show how to hold information related to the operator schedule, it is omitted as an individual data structure. However, each of them has sufficient information that can display the worker information shown in FIG. 3, and any data structure may be used as long as it can be individually identified for each worker.

  6 will be described in more detail. The date unit data structure further comprises an operator unit schedule list structure and an hour unit operator assignment list structure.

  Reference numeral 303 denotes data for holding a pointer to a schedule list for each operator in 2003/12/15 indicated by 300. In FIG. 6, reference to 303 to 404 is indicated by arrows.

  Reference numeral 404 denotes a data structure indicating one schedule based on the operator. This data structure has a linear list structure, and references 409 to 409, which are 404 members. The data structure 404 further includes a pointer 405 to worker information, a work start time 406, a work end time 407, and a pointer 408 to the next schedule. Reference numeral 405 holds a pointer to an operator information data structure 414 indicating an operator corresponding to the operator schedule indicated by 404 data. It can be seen from 415 which is detailed information 414 that the data structure 404 is the schedule of “worker A”. Reference numeral 406 holds data “6:00”, which is the work start time of 2003/12/15 of “worker A”. Reference numeral 407 holds data “21:00”, which is the work end time of 2003/12/15 of “worker A”. 409 following the list from 404 similarly shows another operator schedule of 2003/12/15. Reference numeral 413 represents a NULL pointer indicating that there is no further data structure.

  Reference numeral 414 denotes worker information for one person registered in the operator scheduler. As detailed information 414, an operator name “worker A” is indicated at 415, a worker type “leader” is indicated at 416, and other information is further indicated at 417. Similarly, 418 indicates the worker name “worker B”, 419 indicates the worker type “general position”, 421 indicates other information, 422 indicates the worker name “worker C”, 424. The worker type “general position” and 425 show other information.

  Similarly to 303, 304 is a pointer to the operator unit schedule list, which indicates the schedule list in 2003/12/16 indicated by 301.

  The time unit operator assignment data structure will be described by taking the date 2003/12/16 as an example. The time unit operator assignment information is held in units of 30 minutes. A day is divided into 48, and an array having information in units of 30 minutes is held. Although details are abbreviated, 305 is a pointer to a list corresponding to “7:30 to 8:00”, 306 is also “from 8:00 to 8:30”, and 307 is “12:30 to 13” : A pointer to a list corresponding to “up to 00” is held. 308 holds a pointer to a list corresponding to “from 13:00 to 13:30”, and 309 holds “from 13:00 to 14:00”.

  The further data structure will be described by taking the time zone “13:30 to 14:00” as an example. Reference numeral 309 denotes a pointer that points to a list of operators scheduled to work from “2003/12/16 13:30 to 14:00”. The data structure of the reference destination is a linear list structure. Reference numeral 400 denotes a pointer indicating the first operator in the corresponding time zone, and indicates 414 indicating “worker A”. 401 is a pointer pointing to the next of the list. Reference numeral 402 denotes a pointer indicating the next operator, which indicates 418 indicating “worker B”. The pointer indicating the next of 403 is a NULL pointer, and two operators “worker A” and “worker B” are scheduled to work from 13:30 to 14:00 on 2003/12/16. It turns out that it is.

  When the operator's work schedule is reserved and entered on the operator scheduler screen shown in FIG. 3, it is added to the schedule list structure for each operator on the corresponding date shown in FIG. Furthermore, the schedule is divided in units of 30 minutes, and data is also added to the corresponding positions in the assignment list structure of operators in time units.

  Similarly, when deleting a work schedule, corresponding data is deleted from both of the two types of list structures. The linear list structure can be realized by a known technique, and details concerning editing of the list structure itself are omitted. In the present embodiment, the list structure is shown in units of 30 minutes. However, the present invention is not limited to this, and any time unit can be used.

  Next, processing in the occupation time calculation unit 200 in FIG. 5 will be described based on a flowchart. FIG. 7 is a flowchart showing a procedure for calculating the occupation time required for reservation when making a device use reservation in this embodiment. The processing procedure of FIG. 7 is performed by a CPU (central processing unit) (not shown) of the order receiving server 103 reading and executing a program for the processing from a memory (not shown).

  In FIG. 7, when there is an order for a job, the CPU starts a calculation process from step S1000.

  In step S1001, the CPU selects a device suitable for the received job. At the time of selection, a device having a function required by the job may be selected according to an arbitrary standard and selection means. For example, it is possible to select a device having a duplex printing function for a job for which duplex printing is designated, and a color printer for a job for which color printing is designated. The device options of the system in this embodiment can be acquired from the device data in the database 201 in FIG.

  In step S1002, the CPU ignores exceptional conditions such as manual work and calculates the total time required for the job from the job copy designation and job setting. This calculation can be easily calculated from the information of the selected device. For example, in a printer capable of printing 60 pages per minute, in order to print 30 copies of printed matter of 600 pages, 600 * 30/60 = 300 [minutes], that is, 5 hours. The calculation of the total time ignoring the exception condition is determined if there is a printing speed (60 pages / minute), which is device-specific static information, and information for each job (60 pages printing, 30 copies here). It is possible by the calculation formula. Device-specific information is also obtained from the device data 201 in FIG.

  In step S1003, the CPU extracts manual factor information related to the device from the device data 201. In step S1004, the CPU calculates the timing at which manual work enters according to the manual work factor information and the manual work time at that timing, and creates a list of manual work (timing, time).

  In step S1005, the CPU checks whether there are other manual work factors. If there is a cause (Yes.), The CPU returns to the process of step S1003 and repeats the same process. If not (No.), the CPU proceeds to the process of step S1006.

  In step S1006, the CPU synthesizes the calculated manual (timing, time) lists and merges them into one list.

  In step S1007, the manual operation list is applied to the total time calculated in step S1002, and the operation time of the device is divided.

  In step S1008, the CPU creates a device occupation time list including manual work time. In step S1009, the occupation time calculation ends.

  Next, the process shown in FIG. 7 will be described with a specific example with reference to FIG. FIG. 8 is a diagram showing an example of the processing shown in the flowchart of FIG.

  In FIG. 8, reference numeral 500 denotes the total device use time neglected manually calculated in step S1002. FIG. 8 shows the length in the time direction in the horizontal direction.

  The example of FIG. 8 shows that the selected device has four manual work factors 501, 502, 503, and 504. Reference numerals 501 and 502 are manual operations that are entered at predetermined intervals from the start of the job, and are indicated by horizontal lines that indicate the timing at which the manual operation is entered. Reference numeral 503 is a manual operation that is entered once at the start, and reference numeral 504 is a manual operation that is entered once at the end.

  Reference numeral 501 denotes replenishment of paper feed. Since the previous sheet has already been left at the start of the job, the timing indicated by the dotted line 505 indicates that the start timing of the replenishment cycle is virtually before the start of the job. FIG. 8 shows that the calculation is performed from 505 and manual operations for paper supply such as 506, 507, 508, and 509 are entered at regular intervals. Since 509 is the timing after the end of the job, the manual operation corresponding to 509 is not actually performed. In the timings 506, 507, and 508, manual operations for the periods indicated by 515, 516, and 517 are performed.

  Reference numeral 502 denotes an operation related to the paper discharge tray in order to move the output product from the paper discharge tray. FIG. 8 shows that 502 is also calculated with manual work 511, 512, and 513 at a fixed period from the start. Reference numeral 513 denotes a timing after the job is finished. Actually, since the movement from the paper discharge tray is performed immediately after the job is finished, the timing is determined separately in the manual operation 4 of 504. It is shown that manual operations for the periods indicated by 519 and 520 are performed at timings 511 and 512, respectively.

  Reference numeral 503 denotes device setup at the start of the job. Reference numeral 503 indicates that the job start timing is fixed once, and that manual work for the period indicated by 514 is performed.

  Reference numeral 504 denotes device setup after the end of the job, and includes the last movement of the output from the paper discharge tray. As the timing, the end timing of the job is fixed once, which indicates that the manual operation in the period indicated by 521 is performed.

  Each manual operation indicated by 501, 502, 503, and 504 corresponds to the manual operation factor extracted from the device data in step S 1003 in the flowchart of FIG. 7.

  Reference numeral 522 denotes a state in which the total device usage time indicated by 500 is divided according to manual operations 501, 502, 503, and 504. As a result, it is divided into six areas 530, 531, 532, 533, 534, and 535. Each time range corresponds to the time that the device is operating without the manual operation of the operator.

  The calculation of the division range shown in 522 corresponds to the merge of manual work timing in step S1006 and the division of the total occupation time in step S1007 in the flowchart of FIG.

  Finally, the final device occupation time indicated by 523 is obtained. As shown in FIG. 8, the manual operation time of the operator is inserted between the divided device operation times. From the front, 537 is 514, 538 is 530, 539 is 515, 540 is 531, 541 is 519, 542 is 532, 543 is 516, 544 is 533, 545 is 520, and 546 is 534 corresponds to 517, 548 corresponds to 535, 549 corresponds to 521.

  Next, the holding of information on manual work factors will be described. FIG. 9 shows an example of the data structure of manual work information in this embodiment. The data structure shown in FIG. 9 is recorded in advance in the device data 201 in FIG. 5, and is extracted corresponding to the device selected in step S1003 shown in FIG. FIG. 9 shows an example corresponding to the manual operation 501 in FIG.

  In FIG. 9, reference numeral 600 denotes a device name, and appropriate data is selected based on this value. In the figure, “B” is recorded.

  Reference numeral 601 denotes a work name. In FIG. 8, the contents of manual work performed by the operator during the manual work period inserted in the device occupation time are described here. FIG. 9 shows that “cassette 1 sheet feeding” is recorded.

  Reference numeral 602 denotes a manual work type. In the type of manual work, the type of timing at which the manual work is entered is recorded. In FIG. 9, “period type” is recorded, which indicates that manual work is entered at a predetermined period such as 501 and 502 shown in FIG. 8. In addition, the manual operation type recorded in 602 has values such as “predetermined time type” inserted only once after a predetermined time from the start of the job, and “end type” inserted at the end of the job. Can do.

  Reference numeral 603 denotes a calculation formula for calculating the timing when manual work is performed. The operators and variables used in the calculation formula are predefined in the system in this embodiment. FIG. 9 shows that “amount * pages * 10 / cas1cap” is recorded. The number of output copies (amount) is multiplied by the number of pages per page (pages) and a constant of 10 to obtain a paper feed stacking capacity ( cas1cap). Here, job attributes such as the number of copies and the number of pages can be obtained by using the information recorded in the job ticket received when the job is received, and by inquiring the device about the capabilities of the device such as the paper stacking capacity. . Further, since it is an equation using the paper feed stacking capacity, an offset value such as 505 in FIG. 8 is also calculated. It is to be noted that an arbitrary expression can be described and calculated in 603 by a known technique, and it is needless to say that an expression including an offset value of timing can be explicitly described when considering the remaining amount of paper.

  Reference numeral 604 denotes the time of manual work at that timing. In FIG. 8, the information corresponds to the periods indicated by 515, 516, and 517. FIG. 9 shows that a constant 10 is recorded. Note that an expression that can obtain a dynamic value can be described for 604 as in the case of 603.

  If “predetermined time type” is selected in 602, the description content in 603 is an expression or a constant for calculating the timing at which manual work is inserted from the job start time. If “end type” is selected in the field 602, the description content in the field 603 is ignored.

  The operator work insertion period in the device occupation time indicated by 523 in FIG. 8 is displayed in a portion indicated by “O” in the schedule display example in FIG. Next, the data structure of the device schedule calculated and held by the device schedule unit 203 in FIG. 5 and displayed by the device schedule display unit 204 as shown in FIG. 4 will be described.

  FIG. 10 is a diagram showing an example of the data structure of the device schedule in this embodiment. In the data structure shown in FIG. 10, the schedule data has a multiple structure corresponding to the level of temporary reservation for device reservation temporary reservation described later. First, reference numeral 700 in FIG. 10 is a portion serving as an entrance for referring to the entire device schedule. The first structure is a linear list structure, and each time the list is traced, it is possible to refer to the original schedule that is the base of the provisional reservation. In the example of FIG. 10, the first 701 holds a pointer to the device schedule 730 that assumes the second increase reservation. Following 702, the next 703 holds a pointer to the device schedule 710 that assumes the first increase reservation. Further, when tracing 704, a pointer to the device schedule 720 based on the operator schedule that does not include the appointment reservation, that is, the confirmed operator schedule is held. Since 705 is a fixed schedule, the subsequent 706 indicates a null pointer with no destination. Since the data structures 710, 720, and 730 all have the same configuration, details of the data structure will be described by taking 730 as an example.

  Reference numeral 730 denotes an array of device schedule data based on the device. The array is a pair consisting of a device name for identifying a device and a pointer to schedule detailed data corresponding to the device. In FIG. 10, 731 indicates a device name “Device A”, and 732 indicates a pointer to device schedule detailed data of “Device A”. Reference numeral 733 denotes a device name “Device B”, and reference numeral 734 denotes a pointer to device schedule detailed data of “Device B”. Reference numeral 735 denotes a device name “Device C”, and 736 denotes a pointer to device schedule detailed data of “Device C”.

  Following 732 for “Device A” goes to a list of job schedules held in a linear list structure. Reference numeral 740 denotes a job start time, 741 denotes a job end time, 742 denotes job detailed information, 743 denotes a pointer to manual work information, and 744 denotes a pointer to the next job schedule. After 744, the same structure as 740 to 744 continues, and the job schedule for “Device A” is held in chronological order.

  The data structure 750 referenced from 743 is a manual list held in a linear list structure. Reference numeral 750 holds information related to manual work in the job indicated by 742 in time series. More specifically, reference numeral 750 holds only a link to manual work information, and actual manual work information is further held in a data structure indicated by a linear list structure from 760. The linear list in 750 is held in chronological order with respect to the manual information referred to. In FIG. 10, 751 indicates that 762 is referenced, and 753 after 752 indicates that 764 is referenced. Although omitted in FIG. 10, each node in the 750 linear list similarly refers to 760 predetermined information.

  The data structure of 760 holds all the manual work information in the device schedule from 730 in a time series in a linear list regardless of the device. That is, the linear list of 760 is sorted by the start time of manual work. Reference numerals 761, 762, 763, and 764 denote data structures indicating units of each manual operation. In the figure, data indicated by “T” indicates a time at which manual work is performed, data indicated by “P” indicates a manual work period, and “W” indicates contents of the manual work. For example, taking 762 as an example, 770 indicates the first manual operation start time in the job indicated by 742 in “Device A”, 771 indicates the manual operation period, and 772 indicates the content of the manual operation. 773 indicates 763 which is the next manual operation in time series, but it is understood that it is not a manual operation of the same job. By skipping 763, the next 764 is second manual operation information in the job indicated by 742.

  In the display of the device schedule management application shown in FIG. 4, the device schedule can be displayed based on the information held in the data structure shown in FIG.

  A device schedule for a job performed in the device schedule unit 203 of FIG. 5 will be described. In this embodiment, it is assumed that one of cost priority and delivery date priority is specified when a job is received. In the case of cost priority, a job is assigned according to the schedule of an operator who is already scheduled to work. In the case of delivery date priority, device allocation is prioritized, and if necessary, reservations are made in the operator schedule to increase the number of operators.

  First, the schedule in the case of cost priority will be described. FIG. 11 is an example showing a state in which device scheduling is performed with cost priority in this embodiment.

  The operator schedule at the time of job assignment is shown in the upper part of FIG. The device schedule is shown at the bottom of the figure so that the time is synchronized with it.

  In FIG. 11, reference numerals 800, 801, and 802 indicate worker schedules “Operator1”, “Operator2”, and “Operator3”, respectively. In FIG. 11, the working time range of “Operator1” is indicated by 803, and the working time range of “Operator2” is indicated by 804. In addition, in the range shown in FIG. 11, “Operator3” is not scheduled to work.

  From the above, it can be seen that the number of workers is one, two, and one in each of the time periods 805, 806, and 807, respectively.

  In FIG. 11, 809, 810, and 811 represent schedule states of “Device 1”, “Device 2”, and “Device 3”, respectively. When an order for a job “814” is already received for “Device 3” in a state where the schedule “812” is already set for “Device 1” and 813 is set for “Device 2”, the device schedule shown in 815 is obtained.

  812 has the timing and period indicated by 816 and 818 as the manual operation period, and the period indicated by 817 indicates that the job advances only with the device without the operator. Similarly, 813 has the timing and period indicated by 816 and 821 as the manual work period, and the period 820 indicates that the job proceeds only with the device without the worker.

  Reference numeral 814 indicates that the job received as the device occupation time information including the manual work period has entered as indicated by 523 in FIG. Among these, 822, 824, and 826 indicate manual work periods, and 823 and 825 indicate periods during which a job progresses only with a device without a worker. Here, it is assumed that there is no reservation for using “Device3” in the period shown in FIG. In this case, the job may be arranged anywhere as a schedule of the device. However, if the manual work periods overlap, an operator is required for the overlap period. Therefore, 814 is arranged from the earliest time at which the overlap of the manual work period does not exceed the number of workers in that period in comparison with the number of workers in each time zone. The result is 815.

  More specifically, when the job range indicated by 814 is arranged at the beginning of the time zone shown in FIG. 11, the manual work periods 822 and 816 overlap. However, since the number of workers in the period including 816 is one as shown in 805, manual work cannot be performed. As a result, the schedule is delayed. Therefore, the arrangement of 814 is shifted backward. When the period 819 overlaps with the period 822, the same problem occurs. As a result, the schedule shown in 815 is obtained. Here, the resulting 829 and 818 have overlapping periods, but there is no problem in this time zone because there are two workers as shown in 806. Since the period of 831 is also different from 821, there is no problem even with one worker.

  Another example of cost priority is shown in FIG. FIG. 12 shows a case where the operator's work schedule is “Operator1” alone under the same job order conditions as in FIG. 11. As a result, in the case of FIG. 12, the number of workers is one in the entire range shown in the figure.

  Here, it is assumed that the job indicated by 814 has come as in the case of FIG. 815 indicates that the device is scheduled based on 827 as in FIG. However, despite the overlap of the periods 829 and 818, in FIG. 12, there is only one worker in this time zone. Therefore, in this embodiment, the timing 829 is shifted to the timing 854 as indicated by 851. In the device schedule of the result 851, 852 corresponds to 822, 853 corresponds to 823, 854 corresponds to 824, 855 corresponds to 825, and 856 corresponds to 826. Here, reference numeral 853 includes a device non-operating state in which the period is longer than that of 823 but actually waiting for the start of manual operation. Although the non-operating state of the device is included, this scheduling method makes it possible to accurately schedule according to reality.

  Next, the cost priority device scheduling processing procedure will be described with reference to a flowchart. FIG. 13 is a flowchart showing the cost-priority device scheduling procedure in this embodiment. The processing procedure of FIG. 13 is performed by a CPU (not shown) of the order receiving server 103 reading and executing a program for the processing from a memory (not shown).

  In step S1100, when starting the scheduling of the received job, the CPU first searches for the earliest free time of the target device in step S1101. In this embodiment, a time zone after the end of the list structure from 732 in the data structure example shown in FIG. 10 may be selected. Since the list structure from 732 is held in chronological order, the end of the list is a job that uses the device in the latest time zone. At this point, temporary data is added to the end of the list structure.

  Next, in step S1102, the CPU acquires manual work information on the occupation time of the device. This is information relating to the manual operation timing indicated by 523 in FIG. In the subsequent loop in FIG. 13, the manual operation timing indicated by 523 is acquired in order from the front.

  In step S1103, the CPU determines a tentative time at which the target manual work time is arranged based on the device idle time information with respect to the manual work information acquired in step S1102.

  In step S1104, the number of overlaps between the current manual task to be focused on and the other manual tasks in the time zone in which the manual task is arranged are calculated. This can be obtained by examining the list structure from 760 in FIG. 10 in order. By counting the number of existing manual work information that overlaps a predetermined manual work time zone, it is possible to obtain the number of duplicate manual works.

  Next, in step S1105, the CPU calculates the number of operators in the manual work time zone that is the target of scheduling that is currently focused on. This can be obtained by counting the number of lists in the time zone in the data structure example in FIG. For example, if it is going to be arranged from 13:30 to 14:00 on 2003/12/16 as a manual work time zone, the number of operators is obtained by tracing the linear list from 309 in FIG. 6 and counting the number of data. 2 is understood.

  In step S1106, the CPU compares the duplication number obtained in step S1104 with the number of operators obtained in step S1105. If the number of overlapping manual operations is greater than the number of operators (Yes), the process proceeds to step S1107. If the number of overlapping manual operations is less than or equal to the number of operators, the process advances to step S1108.

  In step S1107, the CPU shifts the manual operation timing with respect to the existing manual operation period. Then, the CPU returns to step S1104, and again obtains the number of duplicated manual operations and the number of operators in that time zone in the shifted manual operation period.

  In step S1108, since the CPU has found that there are enough workers to perform manual work during that time period, the timing is determined for the manual work. Specifically, the CPU inserts manual operation information at an appropriate position in the list structure 760 in FIG. Further, the CPU adds data referring to it to the end of the list structure indicated by 750.

  In step S1109, if the manual operation timing in the job still exists (Yes), the CPU returns to step S1102 and repeats the determination of each manual operation timing. When the timing is determined for all manual operations (No.), the CPU proceeds to step S1110 to determine the device schedule. Specifically, in step S1101, the CPU records the start time and end time of the device schedule in the data structure added at the end of the list.

  In step S1111, the device scheduling in the case of cost priority ends.

  Next, the schedule in the case of delivery date priority will be described. FIG. 14 is an example showing a state in which the device schedule is performed with delivery date priority in this embodiment. In FIG. 14, a delivery schedule priority device schedule is performed under the same conditions as in FIG. 11. In FIG. 14, the same number is assigned to the same condition as in FIG. 11, so only the difference between FIG. 11, that is, cost priority will be described here.

  In FIG. 11, the arrangement “815” of “Device 3” is determined so as to deviate from other manual work timings. In the case of delivery date priority, as shown by 860 in FIG. 14, duplication of manual operation of the device is ignored, and the device is arranged in the earliest time zone where the device is free without shifting the device occupation time.

  Even if the first manual operation period shown in 861 overlaps with 816, the number of operators in that time zone is one, and the work as scheduled cannot be performed. Therefore, if the received job has priority on delivery date, the operator schedule is readjusted.

  In FIG. 15, the readjustment of the operator schedule will be described in more detail. FIG. 15 is a diagram showing changes in the operator schedule and the device schedule when delivery date priority device scheduling is performed. FIG. 15 shows a schedule change in a form in which an operator schedule change state is added to FIG.

  In FIG. 15, the upper stage, the middle stage, and the lower stage respectively represent an operator schedule before the delivery date priority device schedule, the result of the delivery date priority device schedule, and the operator schedule reflecting the result of the delivery date priority device schedule.

  As described above with reference to FIG. 10, in this embodiment, the operator schedule and the device schedule are managed in a multiple configuration, and the provisional reservation schedule is held on the fixed schedule. The provisional reservation schedule is created when it is determined that the operator schedule needs to be increased as a result of the delivery priority device schedule. If it is determined that further increase is necessary in a state where there is a provisional reservation schedule, another provisional reservation schedule is created. In this way, the provisional reservation schedule is configured in multiple.

  The lower operator schedule in FIG. 15 shows a provisional reservation schedule created because an increase in personnel is required due to the delivery date priority device schedule.

  In FIG. 15, as indicated by reference numerals 805, 806, and 807 in the drawing, the schedule for “Device 3” is entered where the number of operators is one, two, and one. Therefore, there is a need for an operator schedule with two persons, one person, two persons, and one person, as indicated by 870, 871, 872, and 873. Therefore, the existing operator schedules 803 and 804 need to be the same operator schedule with 876 added as 874 and 875 as they are. As for 876, as long as one worker other than “Operator1” who is already scheduled to work in 870 time zone enters, any worker may enter. This is created as an operator schedule for provisional reservation, and an increase in the number of persons for a certain period is requested.

  Next, the processing procedure of the delivery date priority device schedule and the update of the operator schedule (temporary reservation creation) associated therewith will be described together with the cost priority device schedule.

  FIG. 16 is a flowchart showing a procedure of the entire device scheduling in this embodiment. The processing procedure of FIG. 16 is performed by a CPU (not shown) of the order receiving server 103 reading and executing a program for the processing from a memory (not shown).

  Since the increase is a provisional reservation, it may or may not be possible. The processing in that case is shown asynchronously, and FIG. 16 includes three flowcharts.

  In step S1200, the entire CPU scheduling is started. In step S1201, the CPU initializes device schedule data and operator schedule data having a multiple configuration. Here, the device schedule is represented by a variable DS, and the operator schedule is represented by a variable OS. Furthermore, a subscript is added to each variable to indicate the number of the multiple configuration. A subscript of 1 represents a fixed schedule as a base, and a subscript of 2 represents a schedule in a state where a provisional reservation is made based on the fixed schedule. Thereafter, each time the subscript increases by 1, this indicates that the schedule is in a state where a provisional reservation is made based on the previous schedule. Further, a variable called max is used to indicate the subscript number representing the final provisional reservation at that time, and here, it is initialized to 1 indicating the fixed schedule. DSmax is device schedule data (730 in the example of FIG. 10) referred to by the pointer data 701 immediately after entering from 700 in the data structure shown in FIG. On the other hand, DS1 is device schedule data (720 in the example of FIG. 10) referred to by pointer data of data traced from 700 to the end of the list.

  Thereafter, the flowchart forms a loop for repeating the job order receiving process. The operator schedule is updated at an arbitrary timing and is not shown in FIG.

  When a job order is received in step S1202, the calculation shown in FIG. 7 is performed. In step S1203, the CPU determines a priority criterion for the received job. The priority criterion is either cost priority or delivery date priority. In the case of cost priority, the CPU proceeds to step S1204. If the delivery date has priority, the CPU proceeds to step S1206.

  First, the case of delivery date priority will be described. In step S1206, the CPU performs a device schedule ignoring the operator schedule as shown in FIG. 14 based on DSmax. Let DStmp be the state where this schedule is performed.

  In step S1207, the CPU determines whether there is a time zone in which the number of manual operations in DStmp exceeds the number of operators in OSmax. When exceeding (Yes), the CPU proceeds to step S1209, and when not exceeding (No.), the CPU proceeds to step S1208.

  In step S1208, the CPU adds DStmp to the DSmax device schedule data. Specifically, the CPU inserts manual operation information at an appropriate position in the list structure 760 in FIG. Further, the CPU adds data referring to it to the end of the list structure indicated by 750. Then, the process returns to step S1202.

  In step S1209, the CPU duplicates DSmax to create DSmax + 1. Then add DStmp to DSmax + 1.

  In step S1210, the CPU creates OSmax + 1 by adding a provisional schedule for increasing reservation to OSmax based on DSmax + 1 by the function of the operator rescheduling unit 205. In step S <b> 1211, the CPU sets a fixed time limit for OSmax + 1 by the function of the operator rescheduling unit 205. In the present embodiment, a fixed value of one week is calculated as a deadline for notifying the customer that the order cannot be kept as scheduled. The operator scheduler 202 receives an instruction from the operator rescheduling unit 205, and displays the screen of FIG. 3 so as to prompt notification of the time limit and confirmation of increase in number.

  In step S1212, the CPU increments max. In this state, the final data including provisional reservation is included in the data structure of the schedule for both DS and OS. Then, the CPU returns to step S1202.

  Next, the case of cost priority will be described. In step S1204, the CPU performs a device schedule according to the flowchart shown in FIG. 13 based on DSmax (DStmp). However, in the description of FIG. 13, it has been described that the data structure shown in FIG. 10 is changed. Here, the device schedule determination process shown in step S1110 is applied to all data structures from DS1 to DSmax as shown in step S1205. . Then, the CPU returns to step S1202.

  The device and operator schedule updates and provisional reservations are updated by repeating the processing described above. On the other hand, even if the fixed deadline set in step S1211, the temporary reservation must be discarded if the number of employees cannot be increased via the screen of FIG. Step S1220 shows the process in that case. If the increase in the number reserved by OS2 has not been achieved even when the OS2 deadline has expired, the CPU cancels the DS2 and schedules after OS2 in step S1221, restores the data structure, and returns max to 1.

If the temporary reservation is successful, the temporary reservation is promoted to a fixed schedule. Step S1230 shows the process in that case. When the increase in the number of OS2s succeeds via the screen of FIG. 3, the CPU shifts i + 1 data to i in both the device schedule and the operator schedule in step S1231, and decrements max in step S1232.
Although the structure of provisional reservation of the device schedule has already been described, the data structure for increasing the operator schedule will be described below.

  FIG. 17 is a diagram showing an example of a data structure in the case of making an operator schedule increase reservation. FIG. 17 shows a state in which data for increasing appointments is added based on FIG.

  The appointment increase is held in the same data structure as the worker. In FIG. 17, a two-stage increase reservation is added. The initial increase reservation is 460, the worker name “461” is set as the worker name, “increase 1” is set as the worker type 462, and “12/09” is set as the final period for the increase reservation 463. . The increase reservation 460 is referred to as an increase from 13:00 to 14:00 on 2003/12/16 from 452 pointers traced from 308 and 450 pointers traced from 309. The next appointment increase is 465, “466 appointment increase” is set as the worker name, “number 2 increase” is set as the worker type, and “12/09” is set as 468 as the deadline for determining the appointment increase. . The increase reservation 465 is referenced from the pointer 454 traced from 305 as the increase from 7:30 to 8:00 on 2003/12/16.

  As described above, the data structure of the operator schedule having two or more subscripts as shown in FIG. 16 is recorded by duplicating the base operator schedule data structure and additionally holding the increase reservation data structure as worker information. Is done.

  In the operator schedule management application screen of FIG. 3, the reservation for increasing the number is displayed in the same manner as for other normal workers, so that it is understood that the number of persons needs to be increased during that time period.

Second Embodiment Hereinafter, a second embodiment of the present invention will be described in detail with reference to the drawings. About 2nd Embodiment, the difference with 1st Embodiment is demonstrated.

  In the first embodiment, for example, as shown in FIG. 11, when shifting is performed so that manual operations do not overlap, the shift is performed based on the manual operation time information shown in FIG. 9. This is not a problem when a plurality of devices are very close to each other or when the number of workers in that time zone is large to some extent. However, when a small number of people carry out manual work of a plurality of jobs, the movement time of the worker actually occurs. In order to perform a more accurate device schedule with fewer workers, it is necessary to consider the travel time of the workers.

  FIG. 18 is a diagram showing the concept of the device schedule in the present embodiment. FIG. 18 corresponds to the process of shifting the device occupation period so that the manual work periods do not overlap in the cost priority device schedule in the first embodiment.

  In FIG. 18, reference numeral 900 in the drawing is a predetermined schedule, and 904 indicates a manual operation period. Reference numeral 905 denotes the time for the operator to move between devices. Reference numeral 901 denotes normal manual overlap avoidance scheduling in the present embodiment, 902 is manual overlap avoidance scheduling that considers only the manual work period as in the first embodiment, and 903 shows overlapping manual work periods. Is shown.

  Reference numeral 906 denotes a manual work period in 901, 907 denotes a movement time in 901, 908 denotes a manual work period in 902, 909 denotes a movement time in 902, 910 denotes a manual work period in 903, and 911 denotes a movement time in 903.

  In FIG. 18, since the manual work period 910 of 903 overlaps with the manual work period 904 of the default schedule, it is determined that the manual work periods overlap. Further, the manual operation period 908 of 902 does not overlap with 904 but overlaps with the movement time 905. And 906 does not overlap with either 904 or 905.

  In the present embodiment, the period is shifted in the state of 901 as much as possible in avoiding duplication of manual work periods. If this is not possible, a 902 shift state is attempted. This procedure will be described with reference to a flowchart.

  FIG. 19 is a flowchart showing a procedure of cost priority device scheduling in this embodiment. The processing procedure of FIG. 19 is performed by a CPU (not shown) of the order receiving server 103 reading and executing a program for the processing from a memory (not shown). The processing shown in FIG. 19 is basically the same as the processing described with reference to FIG. 13, and therefore the same processing portions as those in FIG. 13 are given the same numbers, and only differences from FIG. 13 will be described.

  In FIG. 19, the processing from step S1107 in FIG. 13 is different, and the processing is shown by steps S1301 to S1305.

  In step S1301, the CPU shifts the manual operation timing in consideration of the movement time. This means that a shift method as indicated by reference numeral 901 in FIG. 18 is performed. As for the travel time, a fixed time (for example, 2 minutes) is applied according to the environment in which the system is placed.

  In step S1302, the CPU again calculates the number of manual operations, and counts the number of operators in step S1303. These processes are the same as step S1104 and step S1105. Then, in step S1304, the CPU determines whether or not a new manual work multiple excess has occurred as a result of the time shift considering travel time.

  If no excess has occurred (No.), the process proceeds to step S1108. If an excess has occurred, the CPU proceeds to step S1305.

  In step S1305, the CPU shifts the manual operation timing without considering the movement time. This is the same as step S1107 in FIG. 13, and indicates that a shift method as indicated by 902 in FIG. 18 is performed. Then, the CPU returns to step S1104. The subsequent processing is repeated in the same manner as in the first embodiment.

Effects of Embodiment As described above, according to the first and second embodiments, as a first aspect, the scheduling system includes the device and the device in a printing system including one or more devices that require manual work. A scheduling system (103) for managing a schedule of one or more workers who use the job, a job receiving unit (S1202) for receiving a print job, and an operator schedule unit (202) for managing the working time of the worker. Device scheduling means (203) for managing the usage time of the equipment in association with the print job, and the equipment usage time managed by the device scheduling means including the manual work period by the operator. Occupancy period calculation means for calculating the occupation time (FIG. 7) and the operator schedule A worker number calculating means (S1207, S1204) for calculating the number of workers capable of working in a predetermined time period from the work time of the worker managed by the means and the occupation time of the device; Duplicate manual operation number calculation means (S1207, S1204) for calculating the number of duplicate manual operations in a predetermined time period from the manual operation period included in the occupation time of the device, and the device according to the number of workers and the number of duplicate manual operations Device usage time shifting means (S1204, S1205) for shifting the usage time of the device, the usage time of the device assigned by the device scheduling means, the number of workers, and the number of workers and the number of duplicate manual operations. Operator re-scheduling means (S1207 to S1211) for updating the system (Embodiments 1 and 2).

  With the above configuration, the device is scheduled, and duplication of the manual work of the worker is appropriately avoided at that time, and the schedule result of the device is reflected in the worker's schedule.

  Here, as a second aspect, in the first aspect, the device usage time shift means includes a plurality of jobs so that the number of duplicate manual operations in a predetermined time zone does not exceed the number of workers in the time zone. It is possible to determine the usage time of the device between them (FIG. 13).

  Further, as a third aspect, in the first aspect, the operator rescheduling means may perform the work of the operator when the number of duplicate manual operations in a predetermined time zone exceeds the number of workers in the time zone. The time can be rescheduled (S1207 to S1211).

  Further, as a fourth aspect, in the first or third aspect, the operator rescheduling means holds an operator temporary schedule that holds one or more operator temporary schedules updated by copying the schedule information held by the operator schedule means. Means (S1210), device temporary schedule means (S1209) for holding one or more device temporary schedules updated in a copy of schedule information held by the device schedule means, and setting a fixed time limit for the operator temporary schedule and time-out A temporary schedule time-out means (S1211) for monitoring the temporary schedule, and the temporary schedule for confirming one of the operator temporary schedule and the device temporary schedule within the final schedule of the operator temporary schedule in the main schedule. A rule confirmation means (S1230), and a provisional schedule discarding means (S1220) for discarding one or more provisional schedules of the operator provisional schedule and the device provisional schedule when the expiry date of the operator provisional schedule has passed. It may be characterized by having.

  Further, as a fifth aspect, in the first or second aspect, the device usage time shift means is configured to change the usage time of the device between the manual work period and another manual work period. When manual time periods further overlap as a result of shifting the equipment usage time by the travel time consideration equipment usage time shift means (S1301) that takes into account the travel time of the operator and the travel time consideration equipment usage time shift means The apparatus usage time re-shifting means (S1305) for re-shifting the equipment usage time without including the movement time of the operator is also provided (Embodiment 2).

  With the above configuration, it is possible to perform more accurate device scheduling by avoiding duplication of manual work periods including the movement time of workers.

  Further, as a sixth aspect, in any one of the first to fifth aspects, the use time of the device is shifted so that the job can be manually performed within the range of the number of workers, or the use of the device is performed. When the number of workers is insufficient without shifting the time, the number of workers is further increased, or priority criterion selection means (S1203) for selecting any priority criterion is further provided, and the selection result of the priority criterion selection means The apparatus usage time shift means or the operator reschedule means is used.

  With the above configuration, device scheduling can be performed in accordance with the attribute of order priority job cost priority or delivery date priority. In this case, duplication of operator manual operations can be avoided appropriately, and device schedule results can be reflected in the operator schedule. .

  That is, according to the first and second embodiments, the following configuration is used in order to schedule a job efficiently using both the operator and the device.

The number of operators for each time zone is calculated from an operator scheduler that temporarily reserves the operator's work time zone. When assigning devices in a job, basically, duplication of operator work is avoided in consideration of the device to which the job is assigned and the manual work period of the operator in the device. Further, when avoiding duplication of the manual work period of the operator, scheduling that can be practically performed is performed in consideration of a time difference related to switching of the operator work such as an operator moving time in the work place. On the other hand, select the scheduling priority based on job attributes (order: high number / high cost / early or low number / low cost / may be slow). In the case of delivery time priority, the device is scheduled for the time being, ignoring operator duplication. The device is scheduled based on the selected priority, and the required number of operators for the time period is calculated based on the device schedule. The calculated number of operators is checked against the current operator schedule and fed back to the operator schedule. In other words, it arranges for an increase in staff and approves leave applications. (If the number of operators cannot be adjusted, an accurate delivery date based on the current operator schedule shall be reported.)
When the operator schedule is readjusted, the number of operators cannot be increased immediately, so the request is cached at the longest (second provisional schedule state). During the operator increase application period (for example, one day), the operator schedule is not fixed, and when the next job reservation is entered, the provisional reservation status is also taken into consideration. Keep a multistage schedule.

  With the above configuration, efficient linkage between the operator schedule and the device schedule can be realized, and efficient and accurate scheduling can be performed from both the device and operator viewpoints.

It is a block diagram of the whole system of embodiment which can apply this invention. It is a system configuration figure of a process management part of an embodiment which can apply the present invention. It is a figure of the setting screen of the operator schedule management application of embodiment which can apply this invention. It is a figure of the display screen of the device schedule management application of embodiment which can apply this invention. 1 is a block diagram of a device scheduling system according to an embodiment to which the present invention can be applied. It is a data structure figure of the operator schedule of embodiment which can apply this invention. It is a flowchart of device occupation time calculation of embodiment which can apply this invention. It is a figure which shows the example of the device occupation time calculation of embodiment which can apply this invention. It is a data structure figure of the manual work information of an embodiment which can apply the present invention. It is a data structure figure of the device schedule of an embodiment which can apply the present invention. It is a figure which shows an example of the device schedule by the cost priority of embodiment which can apply this invention. It is a figure which shows an example of the device schedule by the cost priority of embodiment which can apply this invention. It is a flowchart of the device schedule by the cost priority of embodiment which can apply this invention. It is a figure which shows an example of the device schedule in the delivery date priority of embodiment which can apply this invention. It is a figure which shows an example of the operator schedule readjustment of embodiment which can apply this invention. It is a flowchart of the device schedule of embodiment which can apply this invention. It is a data structure figure of the device schedule of an embodiment which can apply the present invention. It is a figure which shows the example of the manual work time shift which considered the movement time of the operator of embodiment which can apply this invention. It is a flowchart of the device schedule in consideration of the movement time of the worker of an embodiment to which the present invention can be applied.

Explanation of symbols

200 Device Occupancy Time Calculation Unit 201 Device Data DB
202 Operator schedule management unit 203 Device schedule unit 204 Device schedule display unit 205 Operator rescheduling unit

Claims (13)

A scheduling system for managing a schedule of the device and one or more workers using the device in a printing system including one or more devices requiring manual work,
Job accepting means for accepting print jobs;
Operator schedule means for managing the working time of the worker;
Device schedule means for managing the usage time of the device in association with the print job;
Occupancy period calculation means for calculating the occupancy time of the equipment including the manual work period by the worker in the usage time of the equipment managed by the device schedule means;
From the work time of the worker managed by the operator schedule means and the occupation time of the equipment, a worker number calculating means for calculating the number of workers that can work in a predetermined time zone,
A duplicate manual labor number calculating means for calculating a duplicate manual labor number in a predetermined time period from the manual labor period included in the occupation time of one or more of the devices;
Device usage time shifting means for shifting the usage time of the device according to the number of workers and the number of duplicate manual operations;
Usage time of the device assigned by the device scheduling means;
A scheduling system comprising: an operator rescheduling unit that updates a work time of the worker according to the number of workers and the number of duplicate manual tasks. The device usage time shift means determines the usage time of the device between a plurality of jobs so that the number of duplicate manual operations in a predetermined time zone does not exceed the number of workers in the time zone. The scheduling system according to claim 1. The operator re-scheduling means reschedules the work time of the worker when the number of duplicate manual operations in a predetermined time zone exceeds the number of workers in the time zone. The scheduling system described. The operator rescheduling means includes:
An operator provisional schedule means for retaining one or more operator provisional schedules in which a copy of the schedule information held by the operator schedule means is updated;
A device provisional schedule means for holding one or more device provisional schedules updated in a copy of schedule information held by the device schedule means;
A temporary schedule time-out means for setting a fixed deadline for the operator temporary schedule and monitoring a time-out;
Provisional schedule confirmation means for confirming each one of the operator provisional schedule and the device provisional schedule in the final schedule within the confirmation period of the operator provisional schedule;
The provisional schedule discarding means for discarding one or more provisional schedules of the operator provisional schedule and the device provisional schedule when the operator provisional schedule finalization deadline has passed. 4. The scheduling system according to 3. The device usage time shift means includes:
A travel time considering device use time shift means that takes into account the travel time of the operator between the manual work period and another manual work period when shifting the use time of the equipment;
As a result of shifting the device usage time by the travel time consideration device usage time shifting means, if the manual work period further overlaps, the device usage time is re-shifted without including the worker's travel time. The scheduling system according to claim 1, further comprising a shift unit. If the job usage time is shifted so that the job can be manually performed within the range of the number of workers, or if the number of workers is insufficient without shifting the device usage time, the number of workers is further increased. Or a priority criterion selecting means for selecting one of the priority criteria,
6. The scheduling system according to claim 1, wherein said device usage time shift means or said operator rescheduling means is used according to a selection result of said priority criterion selection means. A scheduling method of a scheduling system for managing a schedule of the device and one or more workers using the device in a printing system including one or more devices requiring manual work, the scheduling system including the work Operator schedule means for managing the working time of the person, and device schedule means for managing the usage time of the device in association with the print job,
A job receiving step for receiving a print job by the job receiving means;
An occupation period calculation step of calculating an occupation time of the device including a manual work period by the operator in the usage time of the device managed by the device schedule unit by an occupation period calculation unit;
A worker number calculating step for calculating the number of workers capable of working in a predetermined time zone from the worker working time managed by the operator scheduling means and the occupation time of the equipment by the worker number calculating means;
A duplicate manual labor number calculating step for calculating a duplicate manual labor count in a predetermined time period from the manual labor period included in the occupation time of one or more of the devices by a duplicate manual labor number calculating means;
Device usage time shifting means for shifting the usage time of the device according to the number of workers and the number of duplicate manual operations by device usage time shifting means,
An operator rescheduling step of updating the working time of the worker according to the usage time of the device assigned by the device scheduling means and the number of workers and the number of duplicate manual tasks by an operator rescheduling means; A scheduling method characterized by the above. In the device usage time shift step, the device usage time is determined between a plurality of jobs so that the number of duplicate manual operations in a predetermined time zone does not exceed the number of workers in the time zone. The scheduling method according to claim 7. The operator rescheduling step re-schedules the work hours of the workers when the number of duplicate manual operations in a predetermined time zone exceeds the number of workers in the time zone. The scheduling method described. The operator rescheduling step includes:
An operator provisional schedule step for retaining one or more operator provisional schedules updated in a copy of schedule information retained by the operator schedule means;
A device provisional schedule step of retaining one or more device provisional schedules updated in a copy of schedule information retained by the device scheduling means;
A temporary schedule time-out step for setting a fixed deadline for the operator temporary schedule and monitoring a time-out;
A provisional schedule confirmation step for confirming each one of the operator provisional schedule and the device provisional schedule in the final schedule within the confirmation period of the operator provisional schedule;
The provisional schedule discarding step of discarding one or more provisional schedules of the operator provisional schedule and the device provisional schedule when the operator provisional schedule finalization date has passed, respectively. Scheduling method according to claim 1. The device usage time shift step includes:
A shift time considering equipment use time shift step that considers the movement time of the worker between the manual work period and another manual work period when shifting the use time of the equipment;
As a result of shifting the device usage time by the travel time consideration device usage time shifting means, if the manual work period further overlaps, the device usage time is re-shifted without including the worker's travel time. The scheduling method according to claim 7, further comprising a shift step. The priority time selection means shifts the use time of the device so that the job can be manually performed within the range of the number of workers, or the number of workers is insufficient without shifting the use time of the device. In some cases, the method further includes a priority criterion selection step for further increasing the number of workers or selecting one of the priority criteria.
The scheduling method according to claim 7, wherein the device usage time shift step or the operator rescheduling step is executed according to a selection result in the priority criterion selection step. A program for causing a computer to execute each step of the scheduling method according to claim 7.

Images