Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 21 matches
- 2011
- Sunil R. Adhau, Murali Lal Mittal:
A multi-agent based approach for dynamic multi-project scheduling. Int. J. Adv. Oper. Manag. 3(3/4): 230-238 (2011) - G. Balaraju, Sriram Venkatesh, B. Siva Prasad Reddy:
Multi-objective job shop scheduling using hybrid differential evolution approach. Int. J. Adv. Oper. Manag. 3(2): 122-140 (2011) - Robert L. Bregman:
Managing project task time uncertainty with probabilistic time buffers. Int. J. Adv. Oper. Manag. 3(1): 40-65 (2011) - Kaveh Khalili Damghani, Amir-Reza Abtahi:
Measuring efficiency of just in time implementation using a fuzzy data envelopment analysis approach: real case of Iranian dairy industries. Int. J. Adv. Oper. Manag. 3(3/4): 337-354 (2011) - Ali Diabat, Omar Al-Araidah, Imad Alsyouf, Camilla Duh:
A heuristic approach to scheduling jobs in machining centres equipped with automated pallet changers. Int. J. Adv. Oper. Manag. 3(3/4): 326-336 (2011) - P. C. Jha, Remica Aggarwal, Anshu Gupta, P. K. Kapur:
Optimal allocation of promotional resource for multi-product in segmented market for dynamic potential adopter and repeat purchasing diffusion models. Int. J. Adv. Oper. Manag. 3(3/4): 257-270 (2011) - Jibi Job, Jerin Joseph, V. Madhusudanan Pillai:
Performance comparison of process and adaptive cellular layouts using simulation. Int. J. Adv. Oper. Manag. 3(2): 188-200 (2011) - O. A. Joseph, R. Sridharan:
Ranking of scheduling rule combinations in a flexible manufacturing system using preference selection index method. Int. J. Adv. Oper. Manag. 3(2): 201-216 (2011) - B. Shahul Hamid Khan, Kannan Govindan:
A multi-objective simulated annealing algorithm for permutation flow shop scheduling problem. Int. J. Adv. Oper. Manag. 3(1): 88-100 (2011) - Xiaoming Li, V. Sridharan, John J. Kanet, Yifeng Zhang:
Job due-date assignment with earliness and tardiness penalties and stochastic arrival and service times. Int. J. Adv. Oper. Manag. 3(2): 141-152 (2011) - V. Mariappan, A. Subash Babu, S. Rajasekaran, K. Ilayaraja:
Collaborative optimal preventive maintenance schedule using goal programming. Int. J. Adv. Oper. Manag. 3(2): 153-174 (2011) - Shanthi Muthuswamy, Murali Krishnamurthi:
A comparison of simulation and metamodelling approaches for production rate determination. Int. J. Adv. Oper. Manag. 3(3/4): 309-325 (2011) - S. Babu Renga Rajan, K. G. Srinivasagan, K. Ramar, S. Meenachi Sunderasan:
An automated crime pattern detection using k-means clustering. Int. J. Adv. Oper. Manag. 3(3/4): 220-229 (2011) - A. Ramakrishnan, S. Sudalaimuthu:
Application of ANN in non-life insurance industry. Int. J. Adv. Oper. Manag. 3(3/4): 239-256 (2011) - M. Ramasubramanian, M. Mathirajan:
Heuristic algorithms for scheduling a heat-treatment furnace of steel-casting foundry manufacturing. Int. J. Adv. Oper. Manag. 3(3/4): 271-289 (2011) - J. R. Sharma:
Linking voice of customer to product development through quality function deployment (QFD). Int. J. Adv. Oper. Manag. 3(1): 19-39 (2011) - Nima Yazdan Shenas, Abdolhamid Eshraghniaye Jahromi, Kourosh Eshghi:
Shared information in a serial inventory system. Int. J. Adv. Oper. Manag. 3(2): 101-121 (2011) - Mehdi Soltanifar:
Ranking of different common set of weights models using a voting model and its application in determining efficient DMUs. Int. J. Adv. Oper. Manag. 3(3/4): 290-308 (2011) - Michael Sony, V. Mariappan, Vivek Kamat:
Stochastic modelling of failure interaction: Markov model versus discrete event simulation. Int. J. Adv. Oper. Manag. 3(1): 1-18 (2011) - K. Venkata Subbaiah, S. V. Uma Maheswara Rao, K. Srinivasa Rao:
An inventory model for perishable items with alternating rate of production. Int. J. Adv. Oper. Manag. 3(1): 66-87 (2011) - Lotfi Tadj, Chafik Abid:
Optimal management policy for a single and bulk service queue. Int. J. Adv. Oper. Manag. 3(2): 175-187 (2011)
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-08-05 12:12 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint