Document Search Results

Sevastyanov, S. V.; Sitters, R. A.; Fishkin, A. V.

Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays. (English. Russian original) Zbl 1218.93059

Autom. Remote Control 71, No. 10, 2093-2101 (2010); translation from Avtom. Telemekh. 2010, No. 10, 90-99 (2010).

MSC: 93C85 90B35

Cite Review PDF

Full Text: DOI

He, Cheng; Lin, Yixun; Yuan, Jinjiang

A note on the single machine scheduling to minimize the number of tardy jobs with deadlines. (English) Zbl 1176.90220

Eur. J. Oper. Res. 201, No. 3, 966-970 (2010).

MSC: 90B35

Cite Review PDF

Full Text: DOI

Shchepin, Evgeny V.; Vakhania, Nodari N.

Task distributions on multiprocessor systems. (English) Zbl 0998.68021

van Leeuwen, Jan (ed.) et al., Theoretical computer science. Exploring new frontiers of theoretical informatics. International conference IFIP TCS 2000, Sendai, Japan, August 17-19, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1872, 112-125 (2000).

MSC: 68M20 68W25 90B35 68Q25

Cite Review PDF

Chen, Bo; Potts, Chris N.; Strusevich, Vitaly A.

Approximation algorithms for two-machine flow shop scheduling with batch setup times. (English) Zbl 0920.90070

Math. Program. 82, No. 1-2 (B), 255-271 (1998).

MSC: 90B35 90C60

Cite Review PDF

Full Text: DOI

He, Yong

Parametric LPT-bound on parallel machine scheduling with nonsimultaneous machine available time. (English) Zbl 0914.90162

Asia-Pac. J. Oper. Res. 15, No. 1, 29-36 (1998).

MSC: 90B35

Cite Review PDF

Hoogeveen, J. A.; van de Velde, S. L.

Scheduling with target start times. (English) Zbl 0880.90073

Klein Haneveld, W. K. (ed.) et al., Ten years LNMB. Ph.D. research and graduate courses of the Dutch network of operations research. Amsterdam: CWI. CWI Tracts. 122, 45-53 (1997).

MSC: 90B35 90C60

Cite Review PDF

Mosheiov, Gur

\(\Lambda\)-shaped policies to schedule deteriorating jobs. (English) Zbl 0869.90039

J. Oper. Res. Soc. 47, No. 9, 1184-1191 (1996).

MSC: 90B35

Cite Review PDF

Full Text: DOI

Weng, Michael X.; Ventura, Jose A.

Note: “Simultaneous optimization of efficiency and performance balance measures in single-machine scheduling problems”. (English) Zbl 0867.90066

Nav. Res. Logist. 43, No. 2, 313-318 (1996).

MSC: 90B35

Cite Review PDF

Full Text: DOI

Latifi, S.; Srimani, P. K.

Scheduling of independent jobs in star graph networks. (English) Zbl 0862.90079

Comput. Math. Appl. 32, No. 6, 45-55 (1996).

MSC: 90B35

Cite Review PDF

Full Text: DOI

Guinet, A. G. P.; Solomon, M. M.

Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time. (English) Zbl 0927.90033

Int. J. Prod. Res. 34, No. 6, 1643-1654 (1996).

MSC: 90B30 90B35

Cite Review PDF

Full Text: DOI

He, Yong

The LPT-bound of parallel machines scheduling with nonsimultaneous machine available time. (Chinese. English summary) Zbl 0903.90099

J. Zhejiang Univ., Nat. Sci. Ed. 30, No. 3, 333-339 (1996).

MSC: 90B35 90C60

Cite Review PDF

Hoogeveen, J. A.; van de Velde, S. L.

A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle time. (English) Zbl 0884.90102

INFORMS J. Comput. 8, No. 4, 402-412 (1996).

MSC: 90B35

Cite Review PDF

Full Text: DOI

Riera, J.; Alcaide, D.; Sicilia, J.

Approximate algorithms for the \(P\parallel C_{\max}\) problem. (English) Zbl 0887.90085

Top 4, No. 2, 345-359 (1996).

MSC: 90B35

Cite Review PDF

Full Text: DOI

Józefowska, Joanna; Węglarz, Jan

Minimization of mean flow time for some discrete-continuous scheduling problems. (English) Zbl 0885.90056

Bull. Pol. Acad. Sci., Tech. Sci. 44, No. 2, 213-218 (1996).

MSC: 90B35

Cite Review PDF

Pang, Kai-Chi

Algorithmic analysis of the unrelated parallel machines scheduling problem to minimize mean weighted flowtime. (English) Zbl 0843.90058

Int. J. Inf. Manage. Sci. 6, No. 4, 47-72 (1995).

MSC: 90B35

Cite Review PDF

Ng, C. T.; Cai, Xiaoqiang

A pseudo-polynomial algorithm for the completing time variance problem with controllable processing times. (English) Zbl 0827.90078

Derigs, Ulrich (ed.) et al., Operations research proceedings 1994. Selected papers of the international conference on operations research, Berlin, August 30-September 2, 1994. Berlin: Springer-Verlag. 162-167 (1995).

MSC: 90B35 90C60

Cite Review PDF

Chen, Bo; van Vliet, André; Woeginger, Gerhard J.

New lower and upper bounds for on-line scheduling. (English) Zbl 0823.90059

Oper. Res. Lett. 16, No. 4, 221-230 (1994).

MSC: 90B35

Cite Review PDF

Full Text: DOI

Mao, Weizhen; Kincaid, Rex K.

A look-ahead heuristic for scheduling jobs with release dates on a single machine. (English) Zbl 0812.90069

Comput. Oper. Res. 21, No. 10, 1041-1050 (1994).

MSC: 90B35

Cite Review PDF

Full Text: DOI

Chen, Y. L.

Scheduling jobs to minimize total cost. (English) Zbl 0802.90058

Eur. J. Oper. Res. 74, No. 1, 111-119 (1994).

MSC: 90B35 90B10

Cite Review PDF

Full Text: DOI

Weng, M. X.; Ventura, J. A.

A note on ‘single-machine scheduling for minimizing total cost with identical, asymmetrical earliness and tardiness penalties’. (English) Zbl 0903.90103

Int. J. Prod. Res. 32, No. 11, 2725-2729 (1994).

MSC: 90B35

Cite Review PDF

Full Text: DOI

Kahlbacher, H. G.; Cheng, T. C. E.

Parallel machine scheduling to minimize costs for earliness and number of tardy jobs. (English) Zbl 0816.90084

Discrete Appl. Math. 47, No. 2, 139-164 (1993).

Reviewer: H.Kise (Kyoto)

MSC: 90B35 90C60

Cite Review PDF

Full Text: DOI

van de Velde, S. L.

Duality-based algorithms for scheduling unrelated parallel machines. (English) Zbl 0777.90019

ORSA J. Comput. 5, No. 2, 192-205 (1993).

MSC: 90B35

Cite Review PDF

Full Text: DOI Link

Li, Chung-Lun; Chen, Z. L.; Cheng, T. C. E.

A note on one-processor scheduling with asymmetric earliness and tardiness penalties. (English) Zbl 0773.90037

Oper. Res. Lett. 13, No. 1, 45-48 (1993).

MSC: 90B35

Cite Review PDF

Full Text: DOI

Galambos, Gábor; Woeginger, Gerhard J.

An on-line scheduling heuristic with better worst case ratio than Graham’s list scheduling. (English) Zbl 0781.90051

SIAM J. Comput. 22, No. 2, 349-355 (1993).

MSC: 90B35 90C27

Cite Review PDF

Full Text: DOI

Alidaee, B.

Optimal assignment of NOP due-dates and sequencing in a single machine shop. (English) Zbl 0765.90054

Z. Oper. Res. 36, No. 4, 333-341 (1992).

Reviewer: Y.M.Shafranskij (Minsk)

MSC: 90B35 90C60

Cite Review PDF

Full Text: DOI

Du, Jianzhong; Leung, Joseph Y.-T.; Wong, C. S.

Minimizing the number of late jobs with release time constraint. (English) Zbl 0764.90043

J. Comb. Math. Comb. Comput. 11, 97-107 (1992).

MSC: 90B35 90C60

Cite Review PDF

Ng, Chung W.; Young, Gilbert H.

Minimizing maximal weighted earliness and tardiness about a common due date. (English) Zbl 0788.90040

Hoffman, Frederick (ed.) et al., Proceedings of the twenty-third Southeastern international conference on combinatorics, graph theory, and computing, held at Florida Atlantic University, Boca Raton, FL, USA, February 3-7, 1992. Winnipeg: Utilitas Mathematica Publishing Inc.. Congr. Numerantium. 88, 81-95 (1992).

MSC: 90B35 68M20 68Q25

Cite Review PDF

Du, Jianzhong; Leung, Joseph Y.-T.

Minimizing the number of late jobs on unrelated machines. (English) Zbl 0734.90042

Oper. Res. Lett. 10, No. 3, 153-158 (1991).

MSC: 90B35 90C60

Cite Review PDF

Full Text: DOI

De, Prabuddha; Ghosh, Jay B.; Wells, Charles E.

Scheduling to minimize weighted earliness and tardiness about a common due-date. (English) Zbl 0744.90041

Comput. Oper. Res. 18, No. 5, 465-475 (1991).

MSC: 90B35 90-08

Cite Review PDF

Full Text: DOI

Righter, Rhonda; Xu, Susan H.

Scheduling jobs on non-identical IFR processors to minimize general cost functions. (English) Zbl 0745.90040

Adv. Appl. Probab. 23, No. 4, 909-924 (1991).

Reviewer: Y.M.Shafranskij (Minsk)

MSC: 90B35 90C15 93E03

Cite Review PDF

Full Text: DOI

Cheng, T. C. E.

Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine. (English) Zbl 0745.90035

Eur. J. Oper. Res. 51, No. 3, 348-353 (1991).

Reviewer: Y.M.Shafranskij (Minsk)

MSC: 90B35 90C60

Cite Review PDF

Full Text: DOI

Lenstra, Jan Karel; Shmoys, David B.; Tardos, Éva

Approximation algorithms for scheduling unrelated parallel machines. (English) Zbl 0715.90063

Math. Program., Ser. A 46, No. 3, 259-271 (1990).

MSC: 90B35 90C10 90C60 90C05 90-08 65K05

Cite Review PDF

Full Text: DOI

De, Prabuddha; Ghosh, Jay B.; Wells, Charles E.

Scheduling about a common due date with earliness and tardiness penalties. (English) Zbl 0693.90055

Comput. Oper. Res. 17, No. 2, 231-241 (1990).

Reviewer: H.W.Hamacher

MSC: 90B35 65K05

Cite Review PDF

Full Text: DOI

Gonzales, Teofilo; Lawler, Eugene L.; Sahni, Sartaj

Optimal preemptive scheduling of two unrelated processors. (English) Zbl 0755.90042

ORSA J. Comput. 2, No. 3, 219-224 (1990).

MSC: 90B35 90-08

Cite Review PDF

Full Text: DOI

Dileepan, Parthasarati; Sen, Tapan

Job tardiness in unequal parallel processor systems. (English) Zbl 0692.90061

J. Inf. Optim. Sci. 10, No. 3, 579-590 (1989).

MSC: 90B35 65K05 90C09 68N25

Cite Review PDF

Full Text: DOI

Baker, Kenneth R.; Scudder, Gary D.

On the assignment of optimal due dates. (English) Zbl 0674.90052

J. Oper. Res. Soc. 40, No. 1, 93-95 (1989).

MSC: 90B35

Cite Review PDF

Full Text: DOI

Lee, Chung-Yee; Massey, J. David

Multiprocessor scheduling: Combining LPT and MULTIFIT. (English) Zbl 0655.90036

Discrete Appl. Math. 20, No. 3, 233-242 (1988).

Reviewer: M.Papageorgiou

MSC: 90B35 65K05 68M20

Cite Review PDF

Full Text: DOI

Lebedinskaya, N. B.; Safonova, T. E.

Stability of optimal structured schedule. (English. Russian original) Zbl 0685.90056

J. Sov. Math. 47, No. 6, 2861-2870 (1989); translation from Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 159, 56-68 (1987).

MSC: 90B35 68Q25

Cite Review PDF

Full Text: DOI EuDML

Cheng, T. C. E.

Optimal due-date determination and sequencing with random processing times. (English) Zbl 0638.90053

Math. Modelling 9, 573-576 (1987).

MSC: 90B35

Cite Review PDF

Full Text: DOI

Quaddus, M. A.

A generalized model of optimal due-date assignment by linear programming. (English) Zbl 0608.90045

J. Oper. Res. Soc. 38, 353-359 (1987).

MSC: 90B35 90C05

Cite Review PDF

Full Text: DOI

Spyropoulos, C. D.; Evans, D. J.

Analysis of the Q.A.D. algorithm for a homogeneous multiprocessor computing model with independent memories. (English) Zbl 0565.68038

Int. J. Comput. Math. 17, 237-255 (1985).

MSC: 68M20

Cite Review PDF

Full Text: DOI

Lebedinskaya, N. B.

Minimization of the maximum deviation with preemption. (English) Zbl 0557.90048

J. Sov. Math. 28, 354-359 (1985).

MSC: 90B35

Cite Review PDF

Full Text: DOI

Doǧramaci, A.

Production scheduling of independent jobs on parallel identical processors. (English) Zbl 0552.90046

Int. J. Prod. Res. 22, 535-548 (1984).

Reviewer: H.Kise

MSC: 90B35 90B30 65K05 90C39 90C90

Cite Review PDF

Full Text: DOI

Słowiński, Roman

Preemptive scheduling of independent jobs on parallel machines subject to financial constraints. (English) Zbl 0535.90045

Eur. J. Oper. Res. 15, 366-373 (1984).

Reviewer: J.K.Lenstra

MSC: 90B35 65K05 68Q25

Cite Review PDF

Full Text: DOI

Axsäter, Sven

State aggregation in dynamic programming - an application to scheduling of independent jobs on parallel processors. (English) Zbl 0525.90058

Oper. Res. Lett. 2, 171-176 (1983).

MSC: 90B35 90C39

Cite Review PDF

Full Text: DOI

Shakhbazyan, K. V.; Lebedinskaya, N. B.

On optimal preemptive parallel schedulings for independent jobs on processors. (English) Zbl 0515.68033

J. Sov. Math. 23, 2033-2056 (1983).

MSC: 68M20

Cite Review PDF

Full Text: DOI

Gonzalez, Teofilo

Unit execution time shop problems. (English) Zbl 0499.90047

Math. Oper. Res. 7, 57-66 (1982).

MSC: 90B35 68Q25

Cite Review PDF

Full Text: DOI

Erschler, J.; Fontan, G.; Merce, C.; Roubellat, F.

Applying new dominance concepts to job schedule optimization. (English) Zbl 0482.90042

Eur. J. Oper. Res. 11, 60-66 (1982).

MSC: 90B35

Cite Review PDF

Full Text: DOI

Bondarenko, V. A.; Kuksa, A. I.

A solution method for the problem of optimally planning independent jobs in time under constraints on stored and unstored resources. (Russian) Zbl 0535.90061

Investigation methods for extremal problems, Collect. Artic., Kiev 1981, 103-108 (1981).

Reviewer: V.Peteanu

MSC: 90C06 90C10 65K05

Cite Review PDF

Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.

Minimizing maximum lateness in a two-machine open shop. (English) Zbl 0496.90047

Math. Oper. Res. 6, 153-158 (1981).

MSC: 90B35

Cite Review PDF

Full Text: DOI

Cho, Yookun; Sahni, Sartaj

Preemptive scheduling of independent jobs with release and due times on open, flow and job shops. (English) Zbl 0455.90043

Oper. Res. 29, 511-522 (1981).

MSC: 90B35 68Q25

Cite Review PDF

Full Text: DOI

Bertossi, Alan A.

On the complexity of scheduling jobs on dedicated resources to minimize set-up costs. (English) Zbl 0461.68044

Inf. Process. Lett. 10, 173-177 (1980).

MSC: 68M20 68Q25

Cite Review PDF

Full Text: DOI

Baker, Kenneth R.; Nuttle, Henry L. W.

Sequencing independent jobs with a single resource. (English) Zbl 0446.90043

Nav. Res. Logist. Q. 27, 499-510 (1980).

MSC: 90B35

Cite Review PDF

Full Text: DOI

Lakatos, L.

Non-preemptive service of a finite number of jobs. (English) Zbl 0495.90040

Ann. Univ. Sci. Budap. Rolando Eötvös, Sect. Comput. 2, 7-12 (1979).

MSC: 90B22 60K25

Cite Review PDF

Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.

Minimizing maximum lateness in a two-machine open shop. (English) Zbl 0416.90037

Math. Cent., Amst., Afd. Math. Beslisk. BW 112/79, 12 p. (1979).

MSC: 90B35 90C10 68Q25

Cite Review PDF

Lugacev, M. I.

Ein Problem über Verteilung und Anordnung in der kalendarischen Produktionsplanung. (Russian) Zbl 0406.90033

Èkon. Mat. Metody 15, 177-183 (1979).

MSC: 90B35

Cite Review PDF

Lebedinskaya, N. B.

Minimization of maximum penalty in the case of preemption of jobs. (Russian) Zbl 0456.90042

Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 80, 117-124 (1978).

MSC: 90B35

Cite Review PDF

Full Text: EuDML

Shakhbazyan, K. V.; Lebedinskaya, N. B.

On optimal preemptive parallel schedulings for independent jobs on processors. (Russian) Zbl 0413.68037

Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 70, 205-231 (1977).

MSC: 68M20

Cite Review PDF

Full Text: EuDML

Found 58 Documents (Results 1–58)

Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays. (English. Russian original) Zbl 1218.93059

A note on the single machine scheduling to minimize the number of tardy jobs with deadlines. (English) Zbl 1176.90220

Task distributions on multiprocessor systems. (English) Zbl 0998.68021

Approximation algorithms for two-machine flow shop scheduling with batch setup times. (English) Zbl 0920.90070

Parametric LPT-bound on parallel machine scheduling with nonsimultaneous machine available time. (English) Zbl 0914.90162

Scheduling with target start times. (English) Zbl 0880.90073

\(\Lambda\)-shaped policies to schedule deteriorating jobs. (English) Zbl 0869.90039

Note: “Simultaneous optimization of efficiency and performance balance measures in single-machine scheduling problems”. (English) Zbl 0867.90066

Scheduling of independent jobs in star graph networks. (English) Zbl 0862.90079

Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time. (English) Zbl 0927.90033

The LPT-bound of parallel machines scheduling with nonsimultaneous machine available time. (Chinese. English summary) Zbl 0903.90099

A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle time. (English) Zbl 0884.90102

Approximate algorithms for the \(P\parallel C_{\max}\) problem. (English) Zbl 0887.90085

Minimization of mean flow time for some discrete-continuous scheduling problems. (English) Zbl 0885.90056

Algorithmic analysis of the unrelated parallel machines scheduling problem to minimize mean weighted flowtime. (English) Zbl 0843.90058

A pseudo-polynomial algorithm for the completing time variance problem with controllable processing times. (English) Zbl 0827.90078

New lower and upper bounds for on-line scheduling. (English) Zbl 0823.90059

A look-ahead heuristic for scheduling jobs with release dates on a single machine. (English) Zbl 0812.90069

Scheduling jobs to minimize total cost. (English) Zbl 0802.90058

A note on ‘single-machine scheduling for minimizing total cost with identical, asymmetrical earliness and tardiness penalties’. (English) Zbl 0903.90103

Parallel machine scheduling to minimize costs for earliness and number of tardy jobs. (English) Zbl 0816.90084

Duality-based algorithms for scheduling unrelated parallel machines. (English) Zbl 0777.90019

A note on one-processor scheduling with asymmetric earliness and tardiness penalties. (English) Zbl 0773.90037

An on-line scheduling heuristic with better worst case ratio than Graham’s list scheduling. (English) Zbl 0781.90051

Optimal assignment of NOP due-dates and sequencing in a single machine shop. (English) Zbl 0765.90054

Minimizing the number of late jobs with release time constraint. (English) Zbl 0764.90043

Minimizing maximal weighted earliness and tardiness about a common due date. (English) Zbl 0788.90040

Minimizing the number of late jobs on unrelated machines. (English) Zbl 0734.90042

Scheduling to minimize weighted earliness and tardiness about a common due-date. (English) Zbl 0744.90041

Scheduling jobs on non-identical IFR processors to minimize general cost functions. (English) Zbl 0745.90040

Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine. (English) Zbl 0745.90035

Approximation algorithms for scheduling unrelated parallel machines. (English) Zbl 0715.90063

Scheduling about a common due date with earliness and tardiness penalties. (English) Zbl 0693.90055

Optimal preemptive scheduling of two unrelated processors. (English) Zbl 0755.90042

Job tardiness in unequal parallel processor systems. (English) Zbl 0692.90061

On the assignment of optimal due dates. (English) Zbl 0674.90052

Multiprocessor scheduling: Combining LPT and MULTIFIT. (English) Zbl 0655.90036

Stability of optimal structured schedule. (English. Russian original) Zbl 0685.90056

Optimal due-date determination and sequencing with random processing times. (English) Zbl 0638.90053

A generalized model of optimal due-date assignment by linear programming. (English) Zbl 0608.90045

Analysis of the Q.A.D. algorithm for a homogeneous multiprocessor computing model with independent memories. (English) Zbl 0565.68038

Minimization of the maximum deviation with preemption. (English) Zbl 0557.90048

Production scheduling of independent jobs on parallel identical processors. (English) Zbl 0552.90046

Preemptive scheduling of independent jobs on parallel machines subject to financial constraints. (English) Zbl 0535.90045

State aggregation in dynamic programming - an application to scheduling of independent jobs on parallel processors. (English) Zbl 0525.90058

On optimal preemptive parallel schedulings for independent jobs on processors. (English) Zbl 0515.68033

Unit execution time shop problems. (English) Zbl 0499.90047

Applying new dominance concepts to job schedule optimization. (English) Zbl 0482.90042

A solution method for the problem of optimally planning independent jobs in time under constraints on stored and unstored resources. (Russian) Zbl 0535.90061

Minimizing maximum lateness in a two-machine open shop. (English) Zbl 0496.90047

Preemptive scheduling of independent jobs with release and due times on open, flow and job shops. (English) Zbl 0455.90043

On the complexity of scheduling jobs on dedicated resources to minimize set-up costs. (English) Zbl 0461.68044

Sequencing independent jobs with a single resource. (English) Zbl 0446.90043

Non-preemptive service of a finite number of jobs. (English) Zbl 0495.90040

Minimizing maximum lateness in a two-machine open shop. (English) Zbl 0416.90037

Ein Problem über Verteilung und Anordnung in der kalendarischen Produktionsplanung. (Russian) Zbl 0406.90033

Minimization of maximum penalty in the case of preemption of jobs. (Russian) Zbl 0456.90042

On optimal preemptive parallel schedulings for independent jobs on processors. (Russian) Zbl 0413.68037

Filter Results by …

Document Type

Author

Serial

Year of Publication

Main Field