{"doi":"10.1080/002075400418207","title":"The simple and multiple job assignment problems","abstract":null,"journal":"International Journal of Production Research","year":2000,"id":31873,"datarank":0.9212009928751685,"base_score":2.1972245773362196,"endowment":2.1972245773362196,"self_citation_contribution":0.32958368660043297,"citation_network_contribution":0.5916173062747355,"self_endowment_contribution":0.32958368660043297,"citer_contribution":0.5916173062747355,"corpus_percentile":null,"corpus_rank":null,"citation_count":8,"citer_count":8,"citers_with_citation_signal":7,"citers_with_endowment":7,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":169881,"name":"J.-M. Proth","orcid":null,"position":1,"is_corresponding":false},{"id":169884,"name":"A. Soumare","orcid":null,"position":2,"is_corresponding":false},{"id":169880,"name":"F. Chauvet","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":2.1972245773362196,"endowment":2.1972245773362196,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"18998881","pmcid":null,"openalex_id":"https://openalex.org/W2113934189","authors":[],"funders":[],"total_grants":0,"fwci":0.0,"citation_percentile":0.22260405,"influential_citations":0,"citation_trend":[{"year":2013,"count":1},{"year":2016,"count":1},{"year":2019,"count":1},{"year":2025,"count":1}],"oa_status":"green","license":"other-oa","oa_locations":[{"url":"https://inria.hal.science/inria-00072918","host_type":"repository"},{"url":"https://hal.inria.fr/inria-00072918/file/RR-3744.pdf","host_type":"GREEN"},{"url":"https://inria.hal.science/inria-00072918","host_type":"repository"},{"url":"https://www.tandfonline.com/doi/pdf/10.1080/002075400418207","host_type":"publisher"},{"url":"https://doi.org/10.1080/002075400418207","host_type":"journal"},{"url":"http://hdl.handle.net/10068/49553","host_type":"repository"}],"fields_of_study":["Scheduling and Optimization Algorithms","Vehicle Routing Optimization Methods","Scheduling and Timetabling Solutions","Mathematics"],"mesh_terms":[],"keywords":["Generalized assignment problem","Linear bottleneck assignment problem","Weapon target assignment problem","Assignment problem","Mathematical optimization","Bottleneck","Task (project management)","Heuristic","Simple (philosophy)","Integer programming","Computer science","Linear programming","Mathematics","Engineering"],"sdg_mappings":[{"sdg_number":0,"sdg_label":"Decent work and economic growth"}],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-09T09:01:27.707000Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}